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 20, 2026 16:00M-RochatM-RochatScore: 110,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:00110,360551,312,145539,642,0001,125,0002,113,536
2May 20, 2026 16:00110,413551,800,289539,871,0001,155,0002,113,536
3May 20, 2026 16:00110,455553,710,752540,109,0001,125,0002,113,536
4May 20, 2026 16:00110,479552,048,920540,209,0001,142,0002,113,536
5May 20, 2026 16:00110,549554,178,063540,564,0001,128,0002,113,536
6May 20, 2026 16:00110,870553,891,562542,130,0001,136,0002,113,536
7May 20, 2026 16:00112,204561,089,231548,680,0001,123,0002,113,536
8May 20, 2026 16:00113,716569,689,344556,058,0001,153,0002,113,536
9May 20, 2026 16:00113,727567,132,222556,143,0001,122,0002,113,536