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 2, 2026 14:05Josu San MartinJosu San MartinScore: 31,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:0631,012162,762,820150,829,0001,133,0002,113,536
2Aug 2, 2026 14:0631,056162,905,771151,085,0001,094,0002,113,536
3Aug 2, 2026 14:0631,098163,128,203151,236,0001,149,0002,113,536
4Aug 2, 2026 14:0631,121162,745,257151,365,0001,130,0002,113,536
5Aug 2, 2026 14:0631,227163,830,089151,882,0001,131,0002,113,536
6Aug 2, 2026 14:0631,242163,967,172151,939,0001,150,0002,113,536
7Aug 2, 2026 14:0631,265163,186,468152,082,0001,118,0002,113,536
8Aug 2, 2026 14:0631,266163,266,461152,078,0001,129,0002,113,536
9Aug 2, 2026 14:0631,272163,383,889152,124,0001,112,0002,113,536