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:16anboto1anboto1Score: 57,568Success
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:1757,499290,867,269280,652,0001,097,0002,113,536
2Aug 3, 2026 21:1757,526290,950,379280,785,0001,093,0002,113,536
3Aug 3, 2026 21:1757,530290,331,194280,800,0001,099,0002,113,536
4Aug 3, 2026 21:1757,553290,464,701280,930,0001,082,0002,113,536
5Aug 3, 2026 21:1757,568290,513,875280,995,0001,093,0002,113,536
6Aug 3, 2026 21:1757,698291,715,459281,632,0001,090,0002,113,536
7Aug 3, 2026 21:1758,061293,632,002283,337,0001,163,0002,113,536
8Aug 3, 2026 21:1759,108298,774,019288,541,0001,089,0002,113,536
9Aug 3, 2026 21:1759,123298,874,500288,558,0001,147,0002,113,536