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 20:24anboto1anboto1Score: 201,391Success
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 20:24200,999994,842,665983,822,0001,075,0002,113,536
2Jul 31, 2026 20:24201,043995,028,144984,043,0001,072,0002,113,536
3Jul 31, 2026 20:24201,221996,037,314984,905,0001,082,0002,113,536
4Jul 31, 2026 20:24201,361997,513,004985,580,0001,093,0002,113,536
5Jul 31, 2026 20:24201,391996,809,088985,737,0001,080,0002,113,536
6Jul 31, 2026 20:24201,504997,484,272986,286,0001,087,0002,113,536
7Jul 31, 2026 20:24201,560997,691,371986,562,0001,084,0002,113,536
8Jul 31, 2026 20:24201,800998,806,519987,738,0001,082,0002,113,536
9Jul 31, 2026 20:24201,889999,270,491988,182,0001,076,0002,113,536