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:29anboto1anboto1Score: 57,754Success
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:3057,531291,160,591280,810,0001,096,0002,113,536
2Aug 3, 2026 21:3057,542290,383,012280,855,0001,101,0002,113,536
3Aug 3, 2026 21:3057,580290,595,531281,039,0001,103,0002,113,536
4Aug 3, 2026 21:3057,591290,646,339281,109,0001,090,0002,113,536
5Aug 3, 2026 21:3057,754291,498,134281,895,0001,104,0002,113,536
6Aug 3, 2026 21:3057,783291,633,433281,990,0001,151,0002,113,536
7Aug 3, 2026 21:3058,631295,617,708286,121,0001,175,0002,113,536
8Aug 3, 2026 21:3058,710296,807,659286,680,0001,002,0002,113,536
9Aug 3, 2026 21:3059,086297,974,383288,470,0001,052,0002,113,536