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 3, 2026 22:38Victor MerckléVictor MerckléScore: 26,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:3826,075136,325,590126,751,0001,018,0002,117,632stderr
2Sep 3, 2026 22:3826,082136,178,754126,780,0001,022,0002,117,632stderr
3Sep 3, 2026 22:3826,102136,778,588126,822,0001,080,0002,117,632stderr
4Sep 3, 2026 22:3826,104136,382,061126,828,0001,085,0002,117,632stderr
5Sep 3, 2026 22:3826,109136,453,521126,857,0001,081,0002,117,632stderr
6Sep 3, 2026 22:3826,116136,378,172126,871,0001,099,0002,117,632stderr
7Sep 3, 2026 22:3826,142137,862,216126,891,0001,205,0002,117,632stderr
8Sep 3, 2026 22:3826,151136,647,135127,132,0001,012,0002,117,632stderr
9Sep 3, 2026 22:3826,173136,781,618127,155,0001,093,0002,117,632stderr