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:46wnwnScore: 98,980Success
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:4698,399492,993,256480,080,0002,079,0002,113,536
2May 11, 2026 10:4698,485492,160,218480,509,0002,072,0002,113,536
3May 11, 2026 10:4698,578494,198,406480,960,0002,075,0002,113,536
4May 11, 2026 10:4698,961494,348,880482,896,0002,016,0002,113,536
5May 11, 2026 10:4698,980493,969,148482,964,0002,039,0002,113,536
6May 11, 2026 10:4698,986495,282,546482,865,0002,170,0002,113,536
7May 11, 2026 10:4698,986493,640,763483,002,0002,032,0002,113,536
8May 11, 2026 10:4698,996493,843,129483,062,0002,022,0002,113,536
9May 11, 2026 10:4699,024494,597,525483,177,0002,044,0002,113,536