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:25Josu San MartinJosu San MartinScore: 25,835Success
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:2625,804135,504,539125,186,0001,254,0002,113,536
2Aug 4, 2026 16:2625,807135,497,862125,185,0001,271,0002,113,536
3Aug 4, 2026 16:2625,813135,466,721125,223,0001,262,0002,113,536
4Aug 4, 2026 16:2625,830135,567,048125,315,0001,256,0002,113,536
5Aug 4, 2026 16:2625,835135,593,605125,328,0001,264,0002,113,536
6Aug 4, 2026 16:2625,851135,962,745125,402,0001,272,0002,113,536
7Aug 4, 2026 16:2625,854135,691,710125,626,0001,059,0002,113,536
8Aug 4, 2026 16:2625,854135,735,384125,422,0001,265,0002,113,536
9Aug 4, 2026 16:2625,977136,374,574126,020,0001,271,0002,113,536