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 2, 2026 22:16Josu San MartinJosu San MartinScore: 29,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 22:1729,627155,973,923144,034,0001,141,0002,113,536
2Aug 2, 2026 22:1729,629155,627,967144,056,0001,128,0002,113,536
3Aug 2, 2026 22:1729,642155,641,919144,108,0001,138,0002,113,536
4Aug 2, 2026 22:1729,644156,160,114144,120,0001,138,0002,113,536
5Aug 2, 2026 22:1729,650156,078,812144,165,0001,120,0002,113,536
6Aug 2, 2026 22:1729,653156,152,723144,171,0001,130,0002,113,536
7Aug 2, 2026 22:1729,655155,303,998144,201,0001,110,0002,113,536
8Aug 2, 2026 22:1729,682155,527,830144,335,0001,107,0002,113,536
9Aug 2, 2026 22:1729,971157,495,330145,720,0001,138,0002,113,536