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:04anboto1anboto1Score: 149,253Success
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:05148,857739,410,592728,322,0001,079,0002,113,536
2Jul 31, 2026 19:05148,883739,586,370728,445,0001,082,0002,113,536
3Jul 31, 2026 19:05149,006740,091,283729,058,0001,072,0002,113,536
4Jul 31, 2026 19:05149,158740,832,638729,811,0001,067,0002,113,536
5Jul 31, 2026 19:05149,253741,332,026730,267,0001,073,0002,113,536
6Jul 31, 2026 19:05149,255741,506,783730,275,0001,076,0002,113,536
7Jul 31, 2026 19:05149,264741,950,224730,311,0001,085,0002,113,536
8Jul 31, 2026 19:05149,341742,461,571730,696,0001,075,0002,113,536
9Jul 31, 2026 19:05149,513742,616,636731,541,0001,074,0002,113,536