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 listMar 13, 2026 11:41Dominique GarmierDominique GarmierScore: 603,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 11:41603,5342,988,556,6422,957,317,00002,273,280
2Mar 13, 2026 11:41603,5922,985,888,1022,956,600,000999,0002,273,280
3Mar 13, 2026 11:41603,5942,988,656,9322,956,610,000999,0002,269,184
4Mar 13, 2026 11:41603,6022,984,965,6582,956,650,000999,0002,269,184
5Mar 13, 2026 11:41603,7342,987,348,3622,955,297,0002,998,0002,269,184
6Mar 13, 2026 11:41603,8912,988,795,0982,956,067,0002,998,0002,273,280
7Mar 13, 2026 11:41603,9112,990,061,0212,956,166,0002,998,0002,273,280
8Mar 13, 2026 11:41603,9392,987,535,7542,958,302,000999,0002,392,064
9Mar 13, 2026 11:41606,5683,004,063,1572,971,183,000999,0002,269,184