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 21:46Victor MerckléVictor MerckléScore: 25,273Success
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 21:4625,225132,070,695122,583,0001,021,0002,117,632stderr
2Sep 3, 2026 21:4625,269132,227,512122,725,0001,097,0002,117,632stderr
3Sep 3, 2026 21:4625,271132,506,501122,730,0001,101,0002,117,632stderr
4Sep 3, 2026 21:4625,272132,285,216122,748,0001,085,0002,117,632stderr
5Sep 3, 2026 21:4625,273132,721,073122,731,0001,109,0002,117,632stderr
6Sep 3, 2026 21:4625,277132,333,710122,762,0001,099,0002,117,632stderr
7Sep 3, 2026 21:4625,277132,339,108122,768,0001,094,0002,117,632stderr
8Sep 3, 2026 21:4625,283132,381,711122,795,0001,096,0002,117,632stderr
9Sep 3, 2026 21:4625,290132,308,576122,822,0001,099,0002,117,632stderr