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:49anboto1anboto1Score: 152,647Success
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:50152,406756,867,548745,426,0001,365,0002,113,536
2Jul 31, 2026 20:50152,607757,776,566746,412,0001,364,0002,113,536
3Jul 31, 2026 20:50152,613757,733,173746,438,0001,366,0002,113,536
4Jul 31, 2026 20:50152,620757,908,048746,477,0001,361,0002,113,536
5Jul 31, 2026 20:50152,647759,208,518746,608,0001,366,0002,113,536
6Jul 31, 2026 20:50152,663758,090,633746,681,0001,372,0002,113,536
7Jul 31, 2026 20:50152,665758,938,565746,688,0001,371,0002,113,536
8Jul 31, 2026 20:50152,667758,132,059746,701,0001,369,0002,113,536
9Jul 31, 2026 20:50152,867759,057,396747,670,0001,379,0002,113,536