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 19:15Josu San MartinJosu San MartinScore: 25,162Success
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 19:1625,143132,307,422122,114,0001,088,0002,113,536
2Aug 4, 2026 19:1625,148131,704,184122,140,0001,086,0002,113,536
3Aug 4, 2026 19:1625,157131,723,636122,180,0001,093,0002,113,536
4Aug 4, 2026 19:1625,162131,709,712122,207,0001,090,0002,113,536
5Aug 4, 2026 19:1625,162131,719,282122,205,0001,091,0002,113,536
6Aug 4, 2026 19:1625,196131,898,204122,351,0001,113,0002,113,536
7Aug 4, 2026 19:1625,206131,903,763122,423,0001,091,0002,113,536
8Aug 4, 2026 19:1625,383132,796,218123,302,0001,078,0002,113,536
9Aug 4, 2026 19:1625,425133,111,924123,453,0001,134,0002,113,536