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 4, 2026 05:05Josu San MartinJosu San MartinScore: 27,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 05:0627,104141,869,604131,542,0001,272,0002,113,536
2Aug 4, 2026 05:0627,114141,271,972131,597,0001,266,0002,113,536
3Aug 4, 2026 05:0627,122141,336,006131,643,0001,257,0002,113,536
4Aug 4, 2026 05:0627,133141,996,264131,913,0001,042,0002,113,536
5Aug 4, 2026 05:0627,134141,408,388131,702,0001,255,0002,113,536
6Aug 4, 2026 05:0627,157141,470,056131,809,0001,263,0002,113,536
7Aug 4, 2026 05:0627,171141,976,319131,876,0001,266,0002,113,536
8Aug 4, 2026 05:0627,371142,579,453132,853,0001,268,0002,113,536
9Aug 4, 2026 05:0627,404142,792,754133,015,0001,266,0002,113,536