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:25anboto1anboto1Score: 57,913Success
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:2757,592290,675,835281,039,0001,164,0002,113,536
2Aug 3, 2026 20:2757,602291,394,205281,154,0001,098,0002,113,536
3Aug 3, 2026 20:2757,740292,003,896281,779,0001,148,0002,113,536
4Aug 3, 2026 20:2757,783292,004,704282,106,0001,034,0002,113,536
5Aug 3, 2026 20:2757,913292,320,064282,609,0001,165,0002,113,536
6Aug 3, 2026 20:2757,943292,356,835282,825,0001,098,0002,113,536
7Aug 3, 2026 20:2758,069292,951,465283,447,0001,093,0002,113,536
8Aug 3, 2026 20:2758,100293,786,681283,580,0001,113,0002,113,536
9Aug 3, 2026 20:2759,166298,531,308288,817,0001,101,0002,113,536