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 17:23Josu San MartinJosu San MartinScore: 55,058Success
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 17:2355,034279,803,758268,540,0001,129,0002,113,536
2Jul 31, 2026 17:2355,047279,903,077268,628,0001,105,0002,113,536
3Jul 31, 2026 17:2355,048279,885,660268,613,0001,125,0002,113,536
4Jul 31, 2026 17:2355,049279,837,049268,629,0001,112,0002,113,536
5Jul 31, 2026 17:2355,058280,026,980268,664,0001,125,0002,113,536
6Jul 31, 2026 17:2355,059279,872,518268,665,0001,126,0002,113,536
7Jul 31, 2026 17:2355,065279,958,987268,715,0001,108,0002,113,536
8Jul 31, 2026 17:2355,066281,314,241268,580,0001,246,0002,113,536
9Jul 31, 2026 17:2359,659302,664,646291,209,0001,122,0002,113,536