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:38anboto1anboto1Score: 58,194Success
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:4057,962292,437,193282,904,0001,112,0002,113,536
2Aug 3, 2026 20:4058,061293,031,843283,336,0001,163,0002,113,536
3Aug 3, 2026 20:4058,085293,093,792283,571,0001,048,0002,113,536
4Aug 3, 2026 20:4058,145293,371,076283,732,0001,183,0002,113,536
5Aug 3, 2026 20:4058,194293,547,862284,036,0001,118,0002,113,536
6Aug 3, 2026 20:4058,279294,690,840284,459,0001,112,0002,113,536
7Aug 3, 2026 20:4058,325294,233,147284,617,0001,178,0002,113,536
8Aug 3, 2026 20:4058,882297,019,047287,394,0001,130,0002,113,536
9Aug 3, 2026 20:4059,095298,015,393288,327,0001,242,0002,113,536