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 27, 2026 16:36Jasper EdbrookeJasper EdbrookeScore: 123,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 16:36123,008627,413,512467,797,000134,941,0002,523,136
2Mar 27, 2026 16:36123,622629,550,644446,813,000158,933,0002,510,848
3Mar 27, 2026 16:36123,639628,204,733465,872,000139,961,0002,510,848
4Mar 27, 2026 16:36123,699628,337,905468,097,000138,028,0002,510,848
5Mar 27, 2026 16:36123,777630,778,677473,614,000132,891,0002,510,848
6Mar 27, 2026 16:36123,922634,051,341471,168,000136,048,0002,289,664
7Mar 27, 2026 16:36124,263634,419,478479,911,000128,976,0002,289,664
8Mar 27, 2026 16:36124,362634,698,658481,506,000127,868,0002,289,664
9Mar 27, 2026 16:36124,395633,230,211474,640,000134,897,0002,289,664