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 listMar 8, 2026 15:59SneedSneedScore: 1,670,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 15:591,670,3218,214,503,7678,180,577,0003,997,0002,535,424
2Mar 8, 2026 15:591,670,4248,217,030,5088,183,081,0001,999,0002,535,424
3Mar 8, 2026 15:591,670,6418,216,666,6408,183,143,0002,998,0002,535,424
4Mar 8, 2026 15:591,670,7678,225,532,4188,184,761,0001,998,0002,535,424
5Mar 8, 2026 15:591,670,8688,219,247,3148,185,253,0001,999,0002,535,424
6Mar 8, 2026 15:591,671,0278,217,299,6108,182,035,0005,997,0002,535,424
7Mar 8, 2026 15:591,671,2168,223,232,2018,185,961,0002,998,0002,535,424
8Mar 8, 2026 15:591,673,7428,233,265,8468,195,339,0005,996,0002,527,232
9Mar 8, 2026 15:591,685,6138,289,618,6428,258,507,000999,0002,535,424