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:24anboto1anboto1Score: 58,078Success
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:2557,748291,492,294281,957,0001,012,0002,113,536
2Aug 3, 2026 20:2557,784292,196,989281,943,0001,200,0002,113,536
3Aug 3, 2026 20:2557,925292,296,026282,735,0001,099,0002,113,536
4Aug 3, 2026 20:2558,008292,712,086283,160,0001,083,0002,113,536
5Aug 3, 2026 20:2558,078293,859,267283,493,0001,091,0002,113,536
6Aug 3, 2026 20:2558,095293,861,166283,427,0001,242,0002,113,536
7Aug 3, 2026 20:2558,116300,663,845283,635,0001,135,0002,113,536
8Aug 3, 2026 20:2558,143293,294,306283,626,0001,278,0002,113,536
9Aug 3, 2026 20:2558,279294,013,663284,557,0001,013,0002,113,536