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:24Josu San MartinJosu San MartinScore: 30,881Success
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:2530,586160,673,378148,748,0001,128,0002,113,536
2Aug 2, 2026 14:2530,591159,976,485148,766,0001,131,0002,113,536
3Aug 2, 2026 14:2530,592159,969,033148,781,0001,120,0002,113,536
4Aug 2, 2026 14:2530,635160,128,301148,987,0001,126,0002,113,536
5Aug 2, 2026 14:2530,881162,154,437150,184,0001,133,0002,113,536
6Aug 2, 2026 14:2530,901162,153,924150,305,0001,113,0002,113,536
7Aug 2, 2026 14:2530,970163,746,771150,591,0001,165,0002,113,536
8Aug 2, 2026 14:2531,024162,061,821150,896,0001,126,0002,113,536
9Aug 2, 2026 14:2531,178162,790,168151,650,0001,126,0002,113,536