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 listJul 31, 2026 17:46anboto1anboto1Score: 198,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:47198,273981,579,186861,673,000109,868,0002,113,536
2Jul 31, 2026 17:47198,280981,693,159860,875,000110,698,0002,113,536
3Jul 31, 2026 17:47198,582982,866,580861,483,000111,569,0002,113,536
4Jul 31, 2026 17:47198,587983,043,470860,942,000112,137,0002,113,536
5Jul 31, 2026 17:47198,625983,464,397862,342,000110,924,0002,113,536
6Jul 31, 2026 17:47198,664983,359,934862,131,000111,323,0002,113,536
7Jul 31, 2026 17:47198,670983,453,314861,460,000112,023,0002,113,536
8Jul 31, 2026 17:47198,697983,766,691862,453,000111,164,0002,113,536
9Jul 31, 2026 17:47198,715986,947,829862,433,000111,274,0002,113,536