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 3, 2026 21:33anboto1anboto1Score: 58,115Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:3457,721291,904,386281,733,0001,104,0002,113,536
2Aug 3, 2026 21:3457,869292,805,152282,333,0001,229,0002,113,536
3Aug 3, 2026 21:3458,057293,557,907283,391,0001,092,0002,113,536
4Aug 3, 2026 21:3458,108293,831,704283,643,0001,091,0002,113,536
5Aug 3, 2026 21:3458,115293,881,601283,615,0001,151,0002,113,536
6Aug 3, 2026 21:3458,121293,872,809283,644,0001,150,0002,113,536
7Aug 3, 2026 21:3458,133293,799,426283,755,0001,097,0002,113,536
8Aug 3, 2026 21:3458,137293,928,116283,777,0001,098,0002,113,536
9Aug 3, 2026 21:3458,672296,732,807286,405,0001,089,0002,113,536