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:32anboto1anboto1Score: 222,683Success
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:33222,0041,098,052,7241,084,790,0003,031,0002,113,536
2Jul 31, 2026 17:33222,1111,099,779,9651,085,316,0003,031,0002,113,536
3Jul 31, 2026 17:33222,1481,098,731,7181,085,439,0003,088,0002,113,536
4Jul 31, 2026 17:33222,4961,100,561,1291,087,096,0003,139,0002,113,536
5Jul 31, 2026 17:33222,6831,101,393,3881,088,076,0003,073,0002,113,536
6Jul 31, 2026 17:33222,8891,102,633,1421,088,976,0003,182,0002,113,536
7Jul 31, 2026 17:33223,7571,107,403,7271,093,386,0003,026,0002,113,536
8Jul 31, 2026 17:33223,7931,106,860,3491,093,507,0003,082,0002,113,536
9Jul 31, 2026 17:33224,2141,108,830,0561,095,590,0003,059,0002,113,536