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 listMay 11, 2026 10:53wnwnScore: 99,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 10:5498,446493,827,671480,336,0002,052,0002,113,536
2May 11, 2026 10:5498,460494,077,281480,436,0002,022,0002,113,536
3May 11, 2026 10:5498,564492,644,629480,928,0002,036,0002,113,536
4May 11, 2026 10:5498,627492,828,499481,201,0002,076,0002,113,536
5May 11, 2026 10:5499,002496,915,020483,048,0002,063,0002,113,536
6May 11, 2026 10:5499,016494,414,314483,115,0002,065,0002,113,536
7May 11, 2026 10:5499,058495,880,658483,379,0002,007,0002,113,536
8May 11, 2026 10:5499,117496,914,095483,670,0002,006,0002,113,536
9May 11, 2026 10:5499,157494,605,648483,839,0002,031,0002,113,536