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 listMay 13, 2026 05:42Victor MerckléVictor MerckléScore: 63,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 05:4463,692319,564,743310,078,0002,013,0002,138,112
2May 13, 2026 05:4463,693319,597,179310,079,0002,018,0002,138,112
3May 13, 2026 05:4463,703319,483,908310,130,0002,017,0002,138,112
4May 13, 2026 05:4463,709319,794,288310,161,0002,017,0002,138,112
5May 13, 2026 05:4463,716319,614,126310,199,0002,012,0002,138,112
6May 13, 2026 05:4463,736319,991,181310,297,0002,013,0002,138,112
7May 13, 2026 05:4463,770319,972,574310,462,0002,015,0002,138,112
8May 13, 2026 05:4463,778319,986,044310,503,0002,013,0002,138,112
9May 13, 2026 05:4463,836325,070,748309,720,0003,078,0002,138,112