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 15:51Josu San MartinJosu San MartinScore: 25,274Success
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 15:5225,233132,716,500122,394,0001,252,0002,113,536
2Aug 4, 2026 15:5225,242132,076,927122,430,0001,259,0002,113,536
3Aug 4, 2026 15:5225,269132,258,156122,560,0001,262,0002,113,536
4Aug 4, 2026 15:5225,270133,019,972122,575,0001,250,0002,113,536
5Aug 4, 2026 15:5225,274132,283,085122,589,0001,254,0002,113,536
6Aug 4, 2026 15:5225,313132,448,201122,790,0001,246,0002,113,536
7Aug 4, 2026 15:5225,456133,166,144123,474,0001,265,0002,113,536
8Aug 4, 2026 15:5225,470133,821,901123,535,0001,268,0002,113,536
9Aug 4, 2026 15:5225,577134,406,400124,081,0001,251,0002,113,536