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 29, 2026 03:51Josu San MartinJosu San MartinScore: 24,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:5124,209126,984,488117,386,0001,241,0002,113,536
2Aug 29, 2026 03:5124,210127,065,600117,381,0001,249,0002,113,536
3Aug 29, 2026 03:5124,213127,024,947117,388,0001,258,0002,113,536
4Aug 29, 2026 03:5124,215127,065,880117,404,0001,250,0002,113,536
5Aug 29, 2026 03:5124,216127,185,356117,408,0001,253,0002,113,536
6Aug 29, 2026 03:5124,216127,069,082117,404,0001,257,0002,113,536
7Aug 29, 2026 03:5124,250127,214,416117,658,0001,171,0002,113,536
8Aug 29, 2026 03:5124,272127,335,011117,689,0001,248,0002,113,536
9Aug 29, 2026 03:5124,514129,173,460118,878,0001,245,0002,113,536