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 listSep 2, 2026 01:06Victor MerckléVictor MerckléScore: 28,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:0828,033145,750,330136,282,0001,084,0002,117,632stderr
2Sep 2, 2026 01:0828,047145,795,197136,364,0001,070,0002,117,632stderr
3Sep 2, 2026 01:0828,053145,836,479136,365,0001,099,0002,117,632stderr
4Sep 2, 2026 01:0828,056146,595,801136,375,0001,103,0002,117,632stderr
5Sep 2, 2026 01:0828,067146,732,812136,433,0001,100,0002,117,632stderr
6Sep 2, 2026 01:0828,068145,966,735136,453,0001,083,0002,117,632stderr
7Sep 2, 2026 01:0828,069145,984,194136,446,0001,095,0002,117,632stderr
8Sep 2, 2026 01:0828,069145,900,487136,431,0001,108,0002,117,632stderr
9Sep 2, 2026 01:0828,075147,163,276136,453,0001,116,0002,117,632stderr