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 13:04Victor MerckléVictor MerckléScore: 25,680Success
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 13:0725,637134,036,210124,594,0001,030,0002,117,632stderr
2Sep 3, 2026 13:0725,644134,078,366124,628,0001,028,0002,117,632stderr
3Sep 3, 2026 13:0725,650134,712,865124,662,0001,026,0002,117,632stderr
4Sep 3, 2026 13:0725,675134,215,863124,717,0001,093,0002,117,632stderr
5Sep 3, 2026 13:0725,680134,256,683124,730,0001,104,0002,117,632stderr
6Sep 3, 2026 13:0725,688134,316,381124,785,0001,091,0002,117,632stderr
7Sep 3, 2026 13:0725,700134,354,390124,841,0001,092,0002,117,632stderr
8Sep 3, 2026 13:0725,700134,374,632124,821,0001,110,0002,117,632stderr
9Sep 3, 2026 13:0725,705134,744,087124,861,0001,098,0002,117,632stderr