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 31, 2026 18:18anboto1anboto1Score: 387,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:19387,1081,906,945,5081,895,830,0001,001,0002,113,536
2Jul 31, 2026 18:19387,1261,906,994,3141,895,912,0001,006,0002,113,536
3Jul 31, 2026 18:19387,1861,907,357,9891,896,180,0001,032,0002,113,536
4Jul 31, 2026 18:19387,2311,907,420,5021,896,434,0001,000,0002,113,536
5Jul 31, 2026 18:19387,2501,907,615,5831,896,379,0001,149,0002,113,536
6Jul 31, 2026 18:19387,2641,907,574,1361,896,582,0001,013,0002,113,536
7Jul 31, 2026 18:19387,3211,908,151,5961,896,873,0001,003,0002,113,536
8Jul 31, 2026 18:19387,4041,908,259,9281,897,274,0001,010,0002,113,536
9Jul 31, 2026 18:19387,4661,908,613,2751,897,582,0001,005,0002,113,536