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 listMar 15, 2026 10:05limanjun99limanjun99Score: 190,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 10:05190,359954,494,084932,759,00002,273,280
2Mar 15, 2026 10:05190,525959,939,035930,575,0002,998,0002,289,664
3Mar 15, 2026 10:05190,591958,370,472930,899,0002,999,0002,289,664
4Mar 15, 2026 10:05190,600960,457,739931,940,0001,999,0002,289,664
5Mar 15, 2026 10:05190,606960,441,692931,972,0001,999,0002,273,280
6Mar 15, 2026 10:05190,682956,527,160932,345,0001,998,0002,387,968
7Mar 15, 2026 10:05193,468972,676,518945,992,0001,999,0002,269,184
8Mar 15, 2026 10:05193,549972,420,380945,392,0002,998,0002,289,664
9Mar 15, 2026 10:05193,855976,239,030947,891,0001,999,0002,289,664