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 19:03anboto1anboto1Score: 145,874Success
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 19:04145,736724,233,676713,031,0001,077,0002,113,536
2Jul 31, 2026 19:04145,757724,211,172713,133,0001,077,0002,113,536
3Jul 31, 2026 19:04145,767724,216,752713,180,0001,079,0002,113,536
4Jul 31, 2026 19:04145,773724,242,984713,224,0001,067,0002,113,536
5Jul 31, 2026 19:04145,874724,732,105713,701,0001,083,0002,113,536
6Jul 31, 2026 19:04145,879724,672,702713,739,0001,069,0002,113,536
7Jul 31, 2026 19:04145,896724,803,147713,696,0001,197,0002,113,536
8Jul 31, 2026 19:04146,156726,224,253715,087,0001,082,0002,113,536
9Jul 31, 2026 19:04146,241726,586,578715,517,0001,065,0002,113,536