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 listJul 27, 2026 12:52Kevin HeaveyKevin HeaveyScore: 54,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 13:1253,589272,793,856252,323,00010,266,00020,480
2Jul 27, 2026 13:1253,837273,920,453252,237,00011,568,0002,113,536
3Jul 27, 2026 13:1253,983274,601,090253,623,00010,898,0002,113,536
4Jul 27, 2026 13:1254,128277,444,255253,656,00011,572,0002,113,536
5Jul 27, 2026 13:1254,152275,420,562253,128,00012,221,00020,480
6Jul 27, 2026 13:1254,174276,293,587252,993,00012,462,0002,113,536
7Jul 27, 2026 13:1254,197275,726,327252,998,00012,569,00020,480
8Jul 27, 2026 13:1254,290276,092,009252,838,00013,186,0002,113,536
9Jul 27, 2026 13:1254,327276,884,545252,896,00013,310,00020,480