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 12:31Josu San MartinJosu San MartinScore: 25,473Success
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 12:3125,376133,322,516123,078,0001,267,0002,113,536
2Aug 4, 2026 12:3125,398133,407,879123,185,0001,267,0002,113,536
3Aug 4, 2026 12:3125,399133,410,393123,199,0001,257,0002,113,536
4Aug 4, 2026 12:3125,424133,695,984123,575,0001,005,0002,113,536
5Aug 4, 2026 12:3125,473133,438,465123,563,0001,255,0002,113,536
6Aug 4, 2026 12:3125,491133,923,043123,873,0001,035,0002,113,536
7Aug 4, 2026 12:3125,511134,925,301123,951,0001,055,0002,113,536
8Aug 4, 2026 12:3125,607134,512,572124,209,0001,269,0002,113,536
9Aug 4, 2026 12:3125,717135,104,667125,004,0001,011,0002,113,536