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 03:18anboto1anboto1Score: 62,062Success
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 03:1861,806312,863,178301,732,0001,122,0002,113,536
2Aug 3, 2026 03:1861,806313,663,707301,744,0001,110,0002,113,536
3Aug 3, 2026 03:1861,825313,990,944301,840,0001,106,0002,113,536
4Aug 3, 2026 03:1862,032314,095,638302,846,0001,112,0002,113,536
5Aug 3, 2026 03:1862,062314,874,906302,977,0001,130,0002,113,536
6Aug 3, 2026 03:1862,094315,052,545303,138,0001,127,0002,113,536
7Aug 3, 2026 03:1863,979324,276,243312,382,0001,117,0002,113,536
8Aug 3, 2026 03:1863,980324,294,183312,368,0001,136,0002,113,536
9Aug 3, 2026 03:1865,982334,118,668322,204,0001,111,0002,113,536