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 listApr 4, 2026 07:05limanjun99limanjun99Score: 114,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 07:05114,887592,786,241560,947,0001,999,0002,293,760
2Apr 4, 2026 07:05114,895591,497,184561,986,000999,0002,293,760
3Apr 4, 2026 07:05114,900589,213,663561,012,0002,000,0002,269,184
4Apr 4, 2026 07:05114,917584,199,962562,095,0001,000,0002,277,376
5Apr 4, 2026 07:05114,939590,135,275560,206,0002,995,0002,293,760
6Apr 4, 2026 07:05114,966591,203,464561,333,0002,001,0002,359,296
7Apr 4, 2026 07:05114,971588,198,213562,360,000998,0002,273,280
8Apr 4, 2026 07:05114,975590,071,157560,382,0002,996,0002,273,280
9Apr 4, 2026 07:05114,991588,084,654560,460,0002,997,0002,277,376