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 28, 2026 08:54Kevin HeaveyKevin HeaveyScore: 57,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 08:5752,302266,563,850238,901,00017,380,00032,768
2Jul 28, 2026 08:5752,375266,968,003238,713,00017,929,00024,576
3Jul 28, 2026 08:5752,401267,142,007238,654,00018,115,00032,768
4Jul 28, 2026 08:5757,745293,361,829239,689,00043,264,00024,576
5Jul 28, 2026 08:5757,805294,287,151239,226,00044,023,00032,768
6Jul 28, 2026 08:5757,878294,002,586239,461,00044,143,00032,768
7Jul 28, 2026 08:5757,972296,504,413239,517,00044,548,0002,125,824
8Jul 28, 2026 08:5758,123295,292,978239,999,00044,807,0002,125,824
9Jul 28, 2026 08:5759,010299,537,033239,390,00049,759,0002,125,824