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:00anboto1anboto1Score: 57,914Success
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:0257,841291,902,428282,320,0001,101,0002,113,536
2Aug 3, 2026 21:0257,884292,104,524282,516,0001,119,0002,113,536
3Aug 3, 2026 21:0257,900292,700,521282,613,0001,099,0002,113,536
4Aug 3, 2026 21:0257,907292,136,022282,653,0001,092,0002,113,536
5Aug 3, 2026 21:0257,914292,853,797282,706,0001,074,0002,113,536
6Aug 3, 2026 21:0257,932292,951,978282,678,0001,190,0002,113,536
7Aug 3, 2026 21:0257,943292,552,650282,753,0001,169,0002,113,536
8Aug 3, 2026 21:0257,961293,083,697282,924,0001,088,0002,113,536
9Aug 3, 2026 21:0258,374295,140,033284,779,0001,255,0002,113,536