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 3, 2026 06:06Victor MerckléVictor MerckléScore: 50,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 06:0750,475255,195,066245,312,0002,018,0002,117,632stderr
2Jul 3, 2026 06:0750,529255,515,966245,584,0002,010,0002,117,632stderr
3Jul 3, 2026 06:0750,532255,551,357245,567,0002,042,0002,117,632stderr
4Jul 3, 2026 06:0750,579255,829,371245,827,0002,011,0002,117,632stderr
5Jul 3, 2026 06:0750,635255,992,295246,090,0002,026,0002,117,632stderr
6Jul 3, 2026 06:0750,643256,168,038246,115,0002,037,0002,117,632stderr
7Jul 3, 2026 06:0751,560260,534,461250,619,0002,025,0002,117,632stderr
8Jul 3, 2026 06:0751,730261,411,486251,459,0002,019,0002,117,632stderr
9Jul 3, 2026 06:0751,830261,905,318251,764,0002,204,0002,117,632stderr