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 16:02Josu San MartinJosu San MartinScore: 29,964Success
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 16:0329,941156,682,969145,586,0001,126,0002,113,536
2Aug 2, 2026 16:0329,958157,018,213145,671,0001,128,0002,113,536
3Aug 2, 2026 16:0329,962157,328,751145,693,0001,121,0002,113,536
4Aug 2, 2026 16:0329,963156,786,549145,700,0001,123,0002,113,536
5Aug 2, 2026 16:0329,964156,872,745145,702,0001,126,0002,113,536
6Aug 2, 2026 16:0329,977156,917,613145,765,0001,125,0002,113,536
7Aug 2, 2026 16:0330,057157,419,220146,134,0001,149,0002,113,536
8Aug 2, 2026 16:0330,208158,061,996146,895,0001,125,0002,113,536
9Aug 2, 2026 16:0330,216160,357,604146,944,0001,118,0002,113,536