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 19:06Victor MerckléVictor MerckléScore: 35,073Success
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 19:0735,035180,118,651170,654,0001,018,0002,117,632stderr
2Sep 3, 2026 19:0735,041180,151,046170,660,0001,041,0002,117,632stderr
3Sep 3, 2026 19:0735,053180,228,503170,671,0001,089,0002,117,632stderr
4Sep 3, 2026 19:0735,065180,210,351170,724,0001,098,0002,117,632stderr
5Sep 3, 2026 19:0735,073180,296,456170,713,0001,145,0002,117,632stderr
6Sep 3, 2026 19:0735,073180,275,786170,763,0001,099,0002,117,632stderr
7Sep 3, 2026 19:0735,077180,265,013170,768,0001,113,0002,117,632stderr
8Sep 3, 2026 19:0735,097180,365,145170,884,0001,094,0002,117,632stderr
9Sep 3, 2026 19:0735,148180,735,192171,225,0001,005,0002,117,632stderr