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 27, 2026 12:45Kevin HeaveyKevin HeaveyScore: 55,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:5755,582282,116,674261,555,00010,798,00020,480
2Jul 27, 2026 12:5755,663282,910,694261,469,00011,284,00020,480
3Jul 27, 2026 12:5755,709282,834,988260,642,00012,334,00020,480
4Jul 27, 2026 12:5755,750283,481,127262,168,00011,011,0002,113,536
5Jul 27, 2026 12:5755,903283,811,676261,382,00012,545,00020,480
6Jul 27, 2026 12:5755,992284,199,953261,534,00012,829,0002,113,536
7Jul 27, 2026 12:5755,998284,203,456261,424,00012,969,00020,480
8Jul 27, 2026 12:5756,020284,418,193261,599,00012,900,00020,480
9Jul 27, 2026 12:5756,189285,125,356262,272,00013,058,0002,113,536