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 10:01Josu San MartinJosu San MartinScore: 29,244Success
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 10:0129,143151,248,678141,545,0001,259,0002,113,536
2Aug 4, 2026 10:0129,205151,621,643141,858,0001,251,0002,113,536
3Aug 4, 2026 10:0129,235152,332,056141,978,0001,274,0002,113,536
4Aug 4, 2026 10:0129,240151,892,454142,008,0001,270,0002,113,536
5Aug 4, 2026 10:0129,244152,361,089142,046,0001,254,0002,113,536
6Aug 4, 2026 10:0129,249152,334,173142,070,0001,254,0002,113,536
7Aug 4, 2026 10:0129,378152,923,619142,833,0001,120,0002,113,536
8Aug 4, 2026 10:0131,509163,468,541153,136,0001,262,0002,113,536
9Aug 4, 2026 10:0145,988234,466,121224,085,0001,260,0002,113,536