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 listAug 4, 2026 05:12Josu San MartinJosu San MartinScore: 28,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 05:1328,592148,324,993138,830,0001,275,0002,113,536
2Aug 4, 2026 05:1328,621148,695,450138,969,0001,276,0002,113,536
3Aug 4, 2026 05:1328,764149,104,640139,679,0001,267,0002,113,536
4Aug 4, 2026 05:1328,770149,979,884139,729,0001,244,0002,113,536
5Aug 4, 2026 05:1328,791149,500,381139,823,0001,256,0002,113,536
6Aug 4, 2026 05:1328,793149,503,387140,003,0001,084,0002,113,536
7Aug 4, 2026 05:1328,799149,550,868140,111,0001,008,0002,113,536
8Aug 4, 2026 05:1328,825150,095,671139,983,0001,262,0002,113,536
9Aug 4, 2026 05:1328,839149,750,285140,047,0001,267,0002,113,536