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 listMay 11, 2026 10:31wnwnScore: 99,307Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 10:3398,755495,244,964481,886,0002,015,0002,113,536
2May 11, 2026 10:3398,850493,261,903482,353,0002,012,0002,113,536
3May 11, 2026 10:3398,864493,229,475482,363,0002,075,0002,113,536
4May 11, 2026 10:3399,277496,626,374484,451,0002,009,0002,113,536
5May 11, 2026 10:3399,307495,701,799484,529,0002,078,0002,113,536
6May 11, 2026 10:3399,322498,376,842484,651,0002,029,0002,113,536
7May 11, 2026 10:3399,324495,434,686484,642,0002,048,0002,113,536
8May 11, 2026 10:3399,337495,513,711484,739,0002,017,0002,113,536
9May 11, 2026 10:33150,549748,125,767735,525,0002,167,0002,113,536