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 listJul 13, 2025 01:56zielajzielajScore: 41,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 01:5641,776224,673,157200,706,0003,994,0002,457,600
2Jul 13, 2025 01:5641,784225,472,502202,747,0001,997,0002,310,144
3Jul 13, 2025 01:5641,787223,900,127203,760,000998,0002,441,216
4Jul 13, 2025 01:5641,789232,963,145202,769,0001,997,0002,301,952
5Jul 13, 2025 01:5641,796228,499,453203,803,000999,0002,449,408
6Jul 13, 2025 01:5641,801225,358,170203,827,000999,0002,322,432
7Jul 13, 2025 01:5641,801227,658,767203,827,000999,0002,449,408
8Jul 13, 2025 01:5643,176238,737,973211,564,00002,314,240
9Jul 13, 2025 01:5650,530277,474,802244,604,0002,995,0002,314,240