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 07:17wnwnScore: 106,795Success
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 07:18106,236530,179,336517,411,0003,147,0002,113,536
2May 11, 2026 07:18106,269529,362,968517,709,0003,010,0002,113,536
3May 11, 2026 07:18106,273529,569,748517,647,0003,091,0002,113,536
4May 11, 2026 07:18106,285530,546,773517,631,0003,169,0002,113,536
5May 11, 2026 07:18106,795533,728,858520,144,0003,152,0002,113,536
6May 11, 2026 07:18109,674548,981,851534,298,0003,109,0002,113,536
7May 11, 2026 07:18109,744548,930,005534,465,0003,284,0002,113,536
8May 11, 2026 07:18113,236564,376,458551,593,0003,265,0002,113,536
9May 11, 2026 07:18113,242565,604,895551,639,0003,251,0002,113,536