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 14, 2026 03:51olliecrowolliecrowScore: 102,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 03:51102,392533,938,033499,721,0001,998,0002,330,624
2Feb 14, 2026 03:51102,395526,834,375499,736,0001,998,0002,281,472
3Feb 14, 2026 03:51102,429525,532,011499,901,0001,999,0002,281,472
4Feb 14, 2026 03:51102,561529,057,896501,552,000999,0002,314,240
5Feb 14, 2026 03:51102,564529,933,475500,564,0001,998,0002,281,472
6Feb 14, 2026 03:51102,567532,136,060500,579,0001,998,0002,281,472
7Feb 14, 2026 03:51102,567528,515,820501,578,000999,0002,281,472
8Feb 14, 2026 03:51102,593533,273,705500,706,0001,998,0002,281,472
9Feb 14, 2026 03:51102,598532,546,674501,730,000999,0002,281,472