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 23, 2026 16:35Josu San MartinJosu San MartinScore: 86,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 16:3585,977450,156,186420,285,0001,000,0002,269,184
2Jan 23, 2026 16:3585,993451,071,509420,368,000998,0002,269,184
3Jan 23, 2026 16:3586,023449,603,837419,514,0001,997,0002,400,256
4Jan 23, 2026 16:3586,046450,572,016419,627,0001,998,0002,269,184
5Jan 23, 2026 16:3586,051449,719,551419,652,0001,998,0002,404,352
6Jan 23, 2026 16:3586,137453,222,978421,073,0001,000,0002,269,184
7Jan 23, 2026 16:3586,193449,129,334422,345,00002,387,968
8Jan 23, 2026 16:3586,787450,901,895424,257,0001,000,0002,269,184
9Jan 23, 2026 16:3586,919452,277,692423,906,0001,999,0002,400,256