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 21:34Josu San MartinJosu San MartinScore: 29,696Success
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 21:3529,653156,100,763144,178,0001,124,0002,113,536
2Aug 2, 2026 21:3529,655156,067,668144,171,0001,142,0002,113,536
3Aug 2, 2026 21:3529,665156,134,331144,236,0001,124,0002,113,536
4Aug 2, 2026 21:3529,691156,247,863144,347,0001,141,0002,113,536
5Aug 2, 2026 21:3529,696155,580,286144,369,0001,143,0002,113,536
6Aug 2, 2026 21:3529,803156,074,145144,907,0001,131,0002,113,536
7Aug 2, 2026 21:3530,032157,896,682146,015,0001,144,0002,113,536
8Aug 2, 2026 21:3531,898166,521,154155,162,0001,140,0002,113,536
9Aug 2, 2026 21:3532,778170,645,070159,497,0001,117,0002,113,536