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 07:15Josu San MartinJosu San MartinScore: 27,162Success
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 07:1627,113141,250,321131,608,0001,247,0002,113,536
2Aug 4, 2026 07:1627,131141,360,890131,675,0001,271,0002,113,536
3Aug 4, 2026 07:1627,149142,826,843131,761,0001,270,0002,113,536
4Aug 4, 2026 07:1627,150141,242,851131,852,0001,184,0002,113,536
5Aug 4, 2026 07:1627,162141,582,327131,827,0001,268,0002,113,536
6Aug 4, 2026 07:1627,164141,633,392132,099,0001,005,0002,113,536
7Aug 4, 2026 07:1627,177141,394,274131,900,0001,270,0002,113,536
8Aug 4, 2026 07:1627,177141,577,825131,917,0001,253,0002,113,536
9Aug 4, 2026 07:1627,242141,889,856132,213,0001,277,0002,113,536