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 20:11anboto1anboto1Score: 57,702Success
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 20:1157,604291,347,987281,165,0001,099,0002,113,536
2Aug 3, 2026 20:1157,633291,546,456281,282,0001,122,0002,113,536
3Aug 3, 2026 20:1157,675291,686,590281,516,0001,095,0002,113,536
4Aug 3, 2026 20:1157,687291,105,331281,510,0001,161,0002,113,536
5Aug 3, 2026 20:1157,702291,207,428281,572,0001,170,0002,113,536
6Aug 3, 2026 20:1157,732291,403,253281,769,0001,122,0002,113,536
7Aug 3, 2026 20:1157,880292,482,941282,419,0001,194,0002,113,536
8Aug 3, 2026 20:1158,574295,516,584285,855,0001,158,0002,113,536
9Aug 3, 2026 20:1159,189299,087,564288,944,0001,085,0002,113,536