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 listAug 2, 2026 11:27Josu San MartinJosu San MartinScore: 31,428Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:2831,174162,787,414151,630,0001,125,0002,113,536
2Aug 2, 2026 11:2831,177162,851,524151,641,0001,131,0002,113,536
3Aug 2, 2026 11:2831,197162,945,286151,744,0001,126,0002,113,536
4Aug 2, 2026 11:2831,242164,819,559151,951,0001,137,0002,113,536
5Aug 2, 2026 11:2831,428164,091,426152,875,0001,125,0002,113,536
6Aug 2, 2026 11:2831,434166,131,974152,906,0001,125,0002,113,536
7Aug 2, 2026 11:2831,534165,328,453153,401,0001,117,0002,113,536
8Aug 2, 2026 11:2831,542165,356,551153,448,0001,112,0002,113,536
9Aug 2, 2026 11:2831,860166,999,863154,991,0001,127,0002,113,536