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:03Victor MerckléVictor MerckléScore: 25,433Success
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:0425,404132,970,471123,451,0001,029,0002,117,632stderr
2Sep 3, 2026 22:0425,420133,075,438123,517,0001,041,0002,117,632stderr
3Sep 3, 2026 22:0425,429133,291,144123,513,0001,091,0002,117,632stderr
4Sep 3, 2026 22:0425,430133,182,871123,486,0001,125,0002,117,632stderr
5Sep 3, 2026 22:0425,433133,074,922123,534,0001,090,0002,117,632stderr
6Sep 3, 2026 22:0425,435133,003,344123,530,0001,104,0002,117,632stderr
7Sep 3, 2026 22:0425,449134,577,709123,592,0001,111,0002,117,632stderr
8Sep 3, 2026 22:0425,451133,180,052123,615,0001,096,0002,117,632stderr
9Sep 3, 2026 22:0425,468133,913,157123,555,0001,239,0002,117,632stderr