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 31, 2026 19:11anboto1anboto1Score: 229,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:11228,5511,129,841,8011,118,830,0001,070,0002,113,536
2Jul 31, 2026 19:11228,6791,130,461,3191,119,468,0001,062,0002,113,536
3Jul 31, 2026 19:11228,8581,131,462,8781,119,310,0002,095,0002,113,536
4Jul 31, 2026 19:11228,8871,131,655,5001,120,474,0001,075,0002,113,536
5Jul 31, 2026 19:11229,0241,132,391,6361,121,148,0001,071,0002,113,536
6Jul 31, 2026 19:11229,0271,132,269,0051,121,164,0001,073,0002,113,536
7Jul 31, 2026 19:11229,0441,132,230,3671,121,260,0001,060,0002,113,536
8Jul 31, 2026 19:11229,2751,133,356,9711,122,369,0001,080,0002,113,536
9Jul 31, 2026 19:11229,3331,133,803,1321,122,650,0001,085,0002,113,536