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 12:24Victor MerckléVictor MerckléScore: 25,774Success
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 12:2525,668134,163,081124,757,0001,018,0002,117,632stderr
2Sep 3, 2026 12:2525,681134,319,627124,730,0001,109,0002,117,632stderr
3Sep 3, 2026 12:2525,686134,324,865124,732,0001,133,0002,117,632stderr
4Sep 3, 2026 12:2525,754145,270,346124,992,0001,206,0002,117,632stderr
5Sep 3, 2026 12:2525,774139,003,184125,123,0001,170,0002,117,632stderr
6Sep 3, 2026 12:2525,791136,012,790125,153,0001,223,0002,117,632stderr
7Sep 3, 2026 12:2525,854144,448,266125,470,0001,218,0002,117,632stderr
8Sep 3, 2026 12:2525,857142,219,417125,422,0001,278,0002,117,632stderr
9Sep 3, 2026 12:2526,005144,743,824125,323,0002,102,0002,117,632stderr