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 2, 2026 15:53Josu San MartinJosu San MartinScore: 29,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:5729,946156,821,262145,621,0001,118,0002,113,536
2Aug 2, 2026 15:5729,954158,373,013145,640,0001,136,0002,113,536
3Aug 2, 2026 15:5729,955156,898,411145,658,0001,124,0002,113,536
4Aug 2, 2026 15:5729,968156,879,824145,733,0001,115,0002,113,536
5Aug 2, 2026 15:5729,998157,016,744145,885,0001,110,0002,113,536
6Aug 2, 2026 15:5730,234158,920,586147,027,0001,123,0002,113,536
7Aug 2, 2026 15:5730,238158,190,669147,056,0001,114,0002,113,536
8Aug 2, 2026 15:5730,273158,371,788147,199,0001,142,0002,113,536
9Aug 2, 2026 15:5730,285158,477,840147,280,0001,120,0002,113,536