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 listFeb 3, 2026 16:17lipapipalipapipaScore: 118,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 16:17118,294605,048,245574,646,0004,996,0002,375,680
2Feb 3, 2026 16:17118,454615,642,520574,431,0005,994,0002,375,680
3Feb 3, 2026 16:17118,460608,749,628579,455,000999,0002,375,680
4Feb 3, 2026 16:17118,476609,844,180577,535,0002,997,0002,383,872
5Feb 3, 2026 16:17118,494608,408,192577,624,0002,998,0002,383,872
6Feb 3, 2026 16:17118,639609,748,482576,335,0004,994,0002,326,528
7Feb 3, 2026 16:17118,668612,454,286578,476,0002,997,0002,318,336
8Feb 3, 2026 16:17120,468616,090,938587,298,0002,996,0002,322,432
9Feb 3, 2026 16:17122,845633,002,430597,943,0003,999,0002,375,680