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 2, 2026 14:54Josu San MartinJosu San MartinScore: 30,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:5430,552159,755,388148,590,0001,117,0002,113,536
2Aug 2, 2026 14:5430,554159,779,060148,601,0001,116,0002,113,536
3Aug 2, 2026 14:5430,557159,730,026148,607,0001,127,0002,113,536
4Aug 2, 2026 14:5430,565159,793,733148,645,0001,126,0002,113,536
5Aug 2, 2026 14:5430,574159,816,090148,679,0001,136,0002,113,536
6Aug 2, 2026 14:5430,582159,902,924148,739,0001,115,0002,113,536
7Aug 2, 2026 14:5430,728160,725,840149,460,0001,110,0002,113,536
8Aug 2, 2026 14:5430,770161,025,360149,645,0001,131,0002,113,536
9Aug 2, 2026 14:5430,796160,942,946149,789,0001,112,0002,113,536