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 11:22Josu San MartinJosu San MartinScore: 34,908Success
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 11:2334,889180,959,587169,838,0001,119,0002,113,536
2Aug 2, 2026 11:2334,891180,993,093169,838,0001,131,0002,113,536
3Aug 2, 2026 11:2334,903181,035,375169,910,0001,115,0002,113,536
4Aug 2, 2026 11:2334,904181,145,162169,913,0001,119,0002,113,536
5Aug 2, 2026 11:2334,908181,123,026169,948,0001,103,0002,113,536
6Aug 2, 2026 11:2334,911181,925,097169,927,0001,140,0002,113,536
7Aug 2, 2026 11:2334,930181,155,576170,052,0001,105,0002,113,536
8Aug 2, 2026 11:2334,948181,209,639170,131,0001,116,0002,113,536
9Aug 2, 2026 11:2341,623214,061,210202,828,0001,129,0002,113,536