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 02:40Josu San MartinJosu San MartinScore: 27,992Success
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 02:4027,960145,476,658135,747,0001,257,0002,113,536
2Aug 4, 2026 02:4027,970145,542,871136,029,0001,026,0002,113,536
3Aug 4, 2026 02:4027,976147,236,519135,822,0001,264,0002,113,536
4Aug 4, 2026 02:4027,984146,246,457135,863,0001,262,0002,113,536
5Aug 4, 2026 02:4027,992145,609,446136,149,0001,013,0002,113,536
6Aug 4, 2026 02:4027,998145,359,036136,186,0001,005,0002,113,536
7Aug 4, 2026 02:4028,033145,761,061136,097,0001,269,0002,113,536
8Aug 4, 2026 02:4028,061146,571,445136,224,0001,276,0002,113,536
9Aug 4, 2026 02:4028,157147,337,203136,710,0001,260,0002,113,536