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 listFeb 18, 2026 23:56Josu San MartinJosu San MartinScore: 83,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 23:5683,675437,568,151408,008,0002,000,0002,277,376
2Feb 18, 2026 23:5683,695433,189,873410,105,00002,273,280
3Feb 18, 2026 23:5683,710432,706,402410,177,00002,392,064
4Feb 18, 2026 23:5683,714434,478,800406,198,0004,001,0002,523,136
5Feb 18, 2026 23:5683,715430,275,010408,203,0002,000,0002,392,064
6Feb 18, 2026 23:5683,740433,046,545407,322,0003,002,0002,396,160
7Feb 18, 2026 23:5683,751436,146,079409,382,0001,000,0002,396,160
8Feb 18, 2026 23:5683,976436,248,546409,482,0002,002,0002,273,280
9Feb 18, 2026 23:5685,356437,707,057417,242,0001,000,0002,396,160