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 listAug 24, 2026 19:48Victor MerckléVictor MerckléScore: 120,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:49118,302588,044,316577,625,0002,057,0002,117,632stderr
2Aug 24, 2026 19:49118,340588,288,243577,865,0002,002,0002,117,632stderr
3Aug 24, 2026 19:49118,967591,336,221580,915,0002,028,0002,117,632stderr
4Aug 24, 2026 19:49119,602594,548,006584,049,0002,001,0002,117,632stderr
5Aug 24, 2026 19:49120,011596,683,739585,916,0002,139,0002,125,824stderr
6Aug 24, 2026 19:49120,291597,613,928587,302,0002,128,0002,117,632stderr
7Aug 24, 2026 19:49121,190602,324,060591,828,0002,006,0002,117,632stderr
8Aug 24, 2026 19:49122,438608,147,505598,948,0001,002,0002,117,632stderr
9Aug 24, 2026 19:49126,026625,991,186615,404,0002,128,0002,117,632stderr