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 08:51Josu San MartinJosu San MartinScore: 26,535Success
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 08:5326,511138,370,874128,738,0001,170,0002,138,112
2Aug 4, 2026 08:5326,516140,077,261128,749,0001,180,0002,138,112
3Aug 4, 2026 08:5326,523140,138,301128,774,0001,189,0002,138,112
4Aug 4, 2026 08:5326,534140,094,377128,794,0001,226,0002,138,112
5Aug 4, 2026 08:5326,535139,979,260128,822,0001,202,0002,138,112
6Aug 4, 2026 08:5326,543140,186,571127,927,0002,135,0002,138,112
7Aug 4, 2026 08:5326,552140,232,435128,917,0001,191,0002,138,112
8Aug 4, 2026 08:5326,652147,373,822128,328,0002,270,0002,138,112
9Aug 4, 2026 08:5326,698147,838,464128,552,0002,270,0002,138,112