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 28, 2026 21:46Josu San MartinJosu San MartinScore: 25,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:4725,914135,436,490125,721,0001,260,0002,113,536
2Aug 28, 2026 21:4725,930136,100,019125,790,0001,267,0002,113,536
3Aug 28, 2026 21:4725,950135,553,906125,898,0001,259,0002,113,536
4Aug 28, 2026 21:4725,953135,838,812125,919,0001,255,0002,113,536
5Aug 28, 2026 21:4725,980136,141,466126,052,0001,251,0002,113,536
6Aug 28, 2026 21:4725,985135,708,815126,072,0001,257,0002,113,536
7Aug 28, 2026 21:4725,992135,766,070126,110,0001,253,0002,113,536
8Aug 28, 2026 21:4726,013135,876,902126,221,0001,243,0002,113,536
9Aug 28, 2026 21:4726,017137,503,457126,242,0001,244,0002,113,536