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 3, 2026 02:37Josu San MartinJosu San MartinScore: 28,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 02:3828,946150,967,940140,561,0001,276,0002,113,536
2Aug 3, 2026 02:3828,948150,961,727140,580,0001,266,0002,113,536
3Aug 3, 2026 02:3828,954150,888,469140,855,0001,021,0002,113,536
4Aug 3, 2026 02:3828,960151,000,672140,872,0001,034,0002,113,536
5Aug 3, 2026 02:3828,982151,137,375140,744,0001,271,0002,113,536
6Aug 3, 2026 02:3828,999151,189,187140,829,0001,270,0002,113,536
7Aug 3, 2026 02:3829,013151,220,279140,904,0001,263,0002,113,536
8Aug 3, 2026 02:3829,030151,290,622141,241,0001,009,0002,113,536
9Aug 3, 2026 02:3829,151151,975,029141,585,0001,255,0002,113,536