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 1, 2026 22:18Josu San MartinJosu San MartinScore: 32,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 22:1832,504169,495,066158,158,0001,112,0002,113,536
2Aug 1, 2026 22:1832,505170,159,529158,152,0001,127,0002,113,536
3Aug 1, 2026 22:1832,505170,805,499158,143,0001,134,0002,113,536
4Aug 1, 2026 22:1832,510170,162,869158,181,0001,122,0002,113,536
5Aug 1, 2026 22:1832,553169,663,914158,248,0001,263,0002,113,536
6Aug 1, 2026 22:1832,553169,672,325158,381,0001,131,0002,113,536
7Aug 1, 2026 22:1832,565170,427,479158,432,0001,138,0002,113,536
8Aug 1, 2026 22:1832,708170,633,531159,151,0001,121,0002,113,536
9Aug 1, 2026 22:1832,712170,457,153159,175,0001,114,0002,113,536