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 18:09anboto1anboto1Score: 148,043Success
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 18:09147,745733,987,605722,874,0001,079,0002,113,536
2Jul 31, 2026 18:09147,746734,001,334722,881,0001,077,0002,113,536
3Jul 31, 2026 18:09147,862734,515,742723,445,0001,079,0002,113,536
4Jul 31, 2026 18:09147,993735,110,569724,095,0001,075,0002,113,536
5Jul 31, 2026 18:09148,043735,511,634724,338,0001,075,0002,113,536
6Jul 31, 2026 18:09148,050735,379,677724,366,0001,080,0002,113,536
7Jul 31, 2026 18:09148,065735,371,366724,442,0001,077,0002,113,536
8Jul 31, 2026 18:09148,084735,680,719724,539,0001,076,0002,113,536
9Jul 31, 2026 18:09148,343736,885,125725,790,0001,094,0002,113,536