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 listJul 31, 2026 23:41Josu San MartinJosu San MartinScore: 47,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 23:4147,787244,256,905233,055,0001,104,0002,113,536
2Jul 31, 2026 23:4147,802244,372,807233,124,0001,110,0002,113,536
3Jul 31, 2026 23:4147,898244,782,576233,591,0001,113,0002,113,536
4Jul 31, 2026 23:4147,906244,807,421233,652,0001,092,0002,113,536
5Jul 31, 2026 23:4147,913244,979,808233,653,0001,122,0002,113,536
6Jul 31, 2026 23:4147,980245,192,889233,970,0001,136,0002,113,536
7Jul 31, 2026 23:4148,011245,365,098234,130,0001,126,0002,113,536
8Jul 31, 2026 23:4148,060245,610,485234,383,0001,115,0002,113,536
9Jul 31, 2026 23:4148,348248,676,099235,766,0001,140,0002,113,536