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 listJan 23, 2026 18:29Josu San MartinJosu San MartinScore: 84,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 18:2984,546436,950,632413,275,0001,000,0002,269,184
2Jan 23, 2026 18:2984,554437,714,497413,313,0001,000,0002,383,872
3Jan 23, 2026 18:2984,594440,829,358412,512,0001,997,0002,396,160
4Jan 23, 2026 18:2984,613441,545,885412,604,0001,998,0002,269,184
5Jan 23, 2026 18:2984,619440,914,267411,638,0002,997,0002,510,848
6Jan 23, 2026 18:2984,624445,099,739412,658,0001,998,0002,269,184
7Jan 23, 2026 18:2984,648447,297,142413,776,000999,0002,269,184
8Jan 23, 2026 18:2984,666439,030,269411,866,0002,999,0002,519,040
9Jan 23, 2026 18:2986,294453,315,110419,844,0002,998,0002,269,184