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 listMay 20, 2026 15:51M-RochatM-RochatScore: 110,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:51110,500551,040,145540,328,0001,123,0002,113,536
2May 20, 2026 15:51110,657551,761,306541,100,0001,120,0002,113,536
3May 20, 2026 15:51110,727566,348,104541,346,0001,217,0002,113,536
4May 20, 2026 15:51110,925555,507,943542,407,0001,126,0002,113,536
5May 20, 2026 15:51110,957553,818,019542,544,0001,146,0002,113,536
6May 20, 2026 15:51110,970553,166,164542,624,0001,129,0002,113,536
7May 20, 2026 15:51111,506570,582,873545,105,0001,279,0002,117,632
8May 20, 2026 15:51113,756566,921,542556,258,0001,150,0002,113,536
9May 20, 2026 15:51113,927569,806,125557,114,0001,130,0002,113,536