Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listAug 29, 2026 00:03Josu San MartinJosu San MartinScore: 25,170Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 00:0425,153132,196,833122,007,0001,243,0002,113,536
2Aug 29, 2026 00:0425,161131,675,190122,025,0001,266,0002,113,536
3Aug 29, 2026 00:0425,165131,676,136122,038,0001,275,0002,113,536
4Aug 29, 2026 00:0425,168131,483,845122,064,0001,261,0002,113,536
5Aug 29, 2026 00:0425,170131,730,727122,319,0001,018,0002,113,536
6Aug 29, 2026 00:0425,170131,785,943122,078,0001,259,0002,113,536
7Aug 29, 2026 00:0425,210131,910,501122,447,0001,086,0002,113,536
8Aug 29, 2026 00:0425,226131,996,805122,503,0001,108,0002,113,536
9Aug 29, 2026 00:0425,597133,881,401124,370,0001,056,0002,113,536