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 20:26Josu San MartinJosu San MartinScore: 30,343Success
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 20:2630,304158,532,447147,383,0001,109,0002,113,536
2Aug 2, 2026 20:2630,310158,556,281147,383,0001,136,0002,113,536
3Aug 2, 2026 20:2630,320158,590,075147,447,0001,121,0002,113,536
4Aug 2, 2026 20:2630,333158,616,723147,522,0001,114,0002,113,536
5Aug 2, 2026 20:2630,343159,288,875147,549,0001,133,0002,113,536
6Aug 2, 2026 20:2630,353158,782,917147,606,0001,126,0002,113,536
7Aug 2, 2026 20:2630,373159,094,561147,698,0001,130,0002,113,536
8Aug 2, 2026 20:2630,408169,795,799147,816,0001,187,0002,113,536
9Aug 2, 2026 20:2633,222172,899,289161,665,0001,125,0002,113,536