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 listJan 22, 2026 21:10Josu San MartinJosu San MartinScore: 209,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 21:10209,8001,059,747,9911,024,022,0004,000,0002,281,472
2Jan 22, 2026 21:10209,8041,057,661,8971,023,041,0005,000,0002,437,120
3Jan 22, 2026 21:10209,9071,053,592,5911,025,548,0002,998,0002,449,408