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 16:42Valentin KofmanValentin KofmanScore: 156,262Success
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 16:42155,761795,812,192761,229,0002,000,0002,269,184
2Jul 13, 2025 16:42156,027789,544,479761,533,0002,998,0002,289,664
3Jul 13, 2025 16:42156,163788,713,528762,205,0002,996,0002,281,472
4Jul 13, 2025 16:42156,178789,949,691763,272,0002,000,0002,523,136
5Jul 13, 2025 16:42156,262787,180,756762,684,0002,998,0002,273,280
6Jul 13, 2025 16:42156,283792,282,816763,788,0001,999,0002,289,664
7Jul 13, 2025 16:42156,418794,003,303764,451,0001,998,0002,289,664
8Jul 13, 2025 16:42156,740800,873,612766,024,0002,000,0002,277,376
9Jul 13, 2025 16:42157,487793,758,030768,687,0002,998,0002,289,664