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 19:08anboto1anboto1Score: 147,261Success
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 19:08147,009730,815,384719,234,0001,113,0002,113,536
2Jul 31, 2026 19:08147,021730,359,254719,327,0001,080,0002,113,536
3Jul 31, 2026 19:08147,085730,530,224719,661,0001,059,0002,113,536
4Jul 31, 2026 19:08147,173731,094,977720,076,0001,073,0002,113,536
5Jul 31, 2026 19:08147,261731,553,093720,506,0001,076,0002,113,536
6Jul 31, 2026 19:08147,264731,467,838720,514,0001,082,0002,113,536
7Jul 31, 2026 19:08147,286731,805,042720,637,0001,066,0002,113,536
8Jul 31, 2026 19:08147,436732,597,043721,349,0001,090,0002,113,536
9Jul 31, 2026 19:08147,492733,284,861721,632,0001,082,0002,113,536