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 12, 2026 06:20Petsku01Petsku01Score: 823,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 06:20821,9004,056,256,8353,813,453,000213,857,0002,281,472
2Jan 12, 2026 06:20821,9634,052,001,0443,814,745,000212,874,0002,281,472
3Jan 12, 2026 06:20822,4754,060,013,8993,819,279,000210,849,0002,281,472
4Jan 12, 2026 06:20822,7154,059,446,7213,810,451,000220,852,0002,523,136
5Jan 12, 2026 06:20823,0274,061,370,5483,816,950,000215,884,0002,318,336
6Jan 12, 2026 06:20823,0804,064,279,6643,820,247,000212,846,0002,510,848
7Jan 12, 2026 06:20823,1324,061,995,7743,813,492,000219,855,0002,519,040
8Jan 12, 2026 06:20824,0764,063,017,2203,822,083,000215,891,0002,293,760
9Jan 12, 2026 06:20824,8324,075,127,0643,825,803,000215,876,0002,482,176