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 listNov 5, 2025 19:39Daniel MastalerzDaniel MastalerzScore: 204,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 19:39203,3431,023,435,337993,384,0002,998,0002,289,664
2Nov 5, 2025 19:39203,5391,025,375,237994,343,0002,998,0002,289,664
3Nov 5, 2025 19:39203,7661,019,772,311996,455,0001,998,0002,387,968
4Nov 5, 2025 19:39204,2001,027,265,427997,584,0002,998,0002,289,664
5Nov 5, 2025 19:39204,2221,023,801,360998,691,0001,999,0002,273,280
6Nov 5, 2025 19:39204,8441,029,594,0731,001,739,0001,999,0002,289,664
7Nov 5, 2025 19:39206,1081,050,879,9221,008,932,000999,0002,289,664
8Nov 5, 2025 19:39206,4291,041,072,4141,008,506,0002,998,0002,519,040
9Nov 5, 2025 19:39207,1631,041,394,6881,012,103,0002,997,0002,265,088