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 12:38Victor MerckléVictor MerckléScore: 46,803Success
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 12:3846,716236,909,793226,831,0002,078,0002,117,632stderr
2Jul 4, 2026 12:3846,743236,843,156226,994,0002,051,0002,117,632stderr
3Jul 4, 2026 12:3846,768237,196,616227,151,0002,014,0002,117,632stderr
4Jul 4, 2026 12:3846,781237,193,266227,209,0002,018,0002,117,632stderr
5Jul 4, 2026 12:3846,803237,376,345227,327,0002,012,0002,117,632stderr
6Jul 4, 2026 12:3846,846237,500,616227,516,0002,034,0002,117,632stderr
7Jul 4, 2026 12:3847,088238,663,980228,702,0002,033,0002,117,632stderr
8Jul 4, 2026 12:3847,123239,219,199228,873,0002,034,0002,117,632stderr
9Jul 4, 2026 12:3847,469240,571,114230,574,0002,025,0002,117,632stderr