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 20:11Josu San MartinJosu San MartinScore: 47,950Success
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 20:1247,825244,359,636233,248,0001,096,0002,113,536
2Jul 31, 2026 20:1247,860244,869,432233,380,0001,135,0002,113,536
3Jul 31, 2026 20:1247,879244,638,642233,493,0001,117,0002,113,536
4Jul 31, 2026 20:1247,911244,903,030233,625,0001,141,0002,113,536
5Jul 31, 2026 20:1247,950245,055,297233,847,0001,108,0002,113,536
6Jul 31, 2026 20:1247,951245,825,439233,826,0001,136,0002,113,536
7Jul 31, 2026 20:1247,974245,231,637233,946,0001,128,0002,113,536
8Jul 31, 2026 20:1248,081246,572,542234,482,0001,119,0002,113,536
9Jul 31, 2026 20:1252,525267,592,556256,264,0001,112,0002,113,536