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 listJul 4, 2026 22:41Victor MerckléVictor MerckléScore: 46,869Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 22:4246,697236,849,906226,794,0002,024,0002,117,632stderr
2Jul 4, 2026 22:4246,717236,858,886226,904,0002,013,0002,117,632stderr
3Jul 4, 2026 22:4246,773237,150,117227,169,0002,022,0002,117,632stderr
4Jul 4, 2026 22:4246,823237,406,204227,411,0002,023,0002,117,632stderr
5Jul 4, 2026 22:4246,869237,664,193227,615,0002,047,0002,117,632stderr
6Jul 4, 2026 22:4247,013238,411,233228,304,0002,062,0002,117,632stderr
7Jul 4, 2026 22:4247,017238,427,158228,374,0002,012,0002,117,632stderr
8Jul 4, 2026 22:4247,346239,994,761229,981,0002,015,0002,117,632stderr
9Jul 4, 2026 22:4247,597241,241,771231,183,0002,043,0002,117,632stderr