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 listJul 4, 2026 03:24zielajzielajScore: 987,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 03:26984,9284,834,437,9084,823,936,0002,215,0002,121,728stderr
2Jul 4, 2026 03:26986,7844,843,368,0044,833,103,0002,142,0002,121,728stderr
3Jul 4, 2026 03:26986,8434,843,708,0684,833,532,0002,003,0002,121,728stderr
4Jul 4, 2026 03:26986,9974,844,364,7754,834,046,0002,240,0002,121,728stderr
5Jul 4, 2026 03:26987,0434,844,661,7224,834,383,0002,130,0002,121,728stderr
6Jul 4, 2026 03:26987,1364,845,020,1214,834,766,0002,201,0002,121,728stderr
7Jul 4, 2026 03:26987,1654,845,398,0294,835,109,0002,000,0002,121,728stderr
8Jul 4, 2026 03:26987,2254,845,833,4544,834,180,0003,223,0002,121,728stderr
9Jul 4, 2026 03:26987,9114,848,759,9954,838,567,0002,200,0002,121,728stderr