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 21, 2026 20:25Pavel SkripkinPavel SkripkinScore: 195,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:25195,801987,163,518957,429,0001,998,0002,531,328
2Mar 21, 2026 20:25195,812990,666,402957,480,0001,998,0002,269,184
3Mar 21, 2026 20:25195,827981,386,131957,552,0001,999,0002,510,848
4Mar 21, 2026 20:25195,839990,417,347957,613,0001,999,0002,531,328
5Mar 21, 2026 20:25195,859982,667,246957,710,0001,999,0002,437,120
6Mar 21, 2026 20:25195,880981,549,018957,813,0001,999,0002,269,184
7Mar 21, 2026 20:25195,886983,862,147958,840,000999,0002,269,184
8Mar 21, 2026 20:25195,906981,683,972958,942,000999,0002,531,328
9Mar 21, 2026 20:25196,516987,328,719961,931,000999,0002,433,024