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 16:47Josu San MartinJosu San MartinScore: 25,206Success
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 16:4825,137131,630,258121,927,0001,247,0002,113,536
2Aug 4, 2026 16:4825,184132,443,403122,141,0001,264,0002,113,536
3Aug 4, 2026 16:4825,191131,977,212122,169,0001,269,0002,113,536
4Aug 4, 2026 16:4825,206131,890,006122,252,0001,260,0002,113,536
5Aug 4, 2026 16:4825,206132,681,816122,369,0001,145,0002,113,536
6Aug 4, 2026 16:4825,211131,943,378122,277,0001,259,0002,113,536
7Aug 4, 2026 16:4825,221132,685,121122,339,0001,244,0002,113,536
8Aug 4, 2026 16:4825,361133,115,060123,013,0001,258,0002,113,536
9Aug 4, 2026 16:4830,278156,794,392147,112,0001,253,0002,113,536