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:14Josu San MartinJosu San MartinScore: 24,416Success
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:1424,393128,531,590118,271,0001,257,0002,113,536
2Aug 29, 2026 03:1424,403128,698,455118,305,0001,270,0002,113,536
3Aug 29, 2026 03:1424,410128,665,158118,347,0001,264,0002,113,536
4Aug 29, 2026 03:1424,415128,691,311118,370,0001,265,0002,113,536
5Aug 29, 2026 03:1424,416128,578,323118,384,0001,256,0002,113,536
6Aug 29, 2026 03:1424,416128,567,351118,379,0001,262,0002,113,536
7Aug 29, 2026 03:1424,420127,809,533118,395,0001,263,0002,113,536
8Aug 29, 2026 03:1424,699129,989,597119,784,0001,243,0002,113,536
9Aug 29, 2026 03:1426,704140,509,972129,596,0001,256,0002,113,536