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 10:19Josu San MartinJosu San MartinScore: 29,513Success
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 10:1929,501153,629,171143,306,0001,252,0002,113,536
2Aug 3, 2026 10:1929,501153,107,119143,304,0001,253,0002,113,536
3Aug 3, 2026 10:1929,507153,008,000143,325,0001,264,0002,113,536
4Aug 3, 2026 10:1929,513153,689,336143,359,0001,255,0002,113,536
5Aug 3, 2026 10:1929,513153,058,181143,359,0001,258,0002,113,536
6Aug 3, 2026 10:1929,514153,103,713143,360,0001,259,0002,113,536
7Aug 3, 2026 10:1929,522152,921,062143,600,0001,062,0002,113,536
8Aug 3, 2026 10:1929,539153,098,088143,490,0001,253,0002,113,536
9Aug 3, 2026 10:1930,471158,324,321148,303,0001,006,0002,113,536