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 3, 2026 21:11anboto1anboto1Score: 57,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:1357,554290,512,792280,906,0001,111,0002,113,536
2Aug 3, 2026 21:1357,610290,716,432281,188,0001,104,0002,113,536
3Aug 3, 2026 21:1357,624290,880,872281,193,0001,165,0002,113,536
4Aug 3, 2026 21:1357,688291,148,228281,574,0001,098,0002,113,536
5Aug 3, 2026 21:1357,731291,101,213281,854,0001,030,0002,113,536
6Aug 3, 2026 21:1357,882292,619,740282,529,0001,095,0002,113,536
7Aug 3, 2026 21:1358,026293,361,840283,229,0001,101,0002,113,536
8Aug 3, 2026 21:1358,240293,865,451284,357,0001,022,0002,113,536
9Aug 3, 2026 21:1359,131298,218,313288,627,0001,115,0002,113,536