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 listAug 3, 2026 22:02anboto1anboto1Score: 58,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 22:0258,328294,831,198284,776,0001,033,0002,113,536
2Aug 3, 2026 22:0258,473295,071,585284,388,0002,131,0002,113,536
3Aug 3, 2026 22:0258,595295,602,100286,013,0001,107,0002,113,536
4Aug 3, 2026 22:0258,652295,810,350286,305,0001,092,0002,113,536
5Aug 3, 2026 22:0258,706296,279,692286,509,0001,151,0002,113,536
6Aug 3, 2026 22:0258,839296,896,267287,309,0001,005,0002,113,536
7Aug 3, 2026 22:0259,251298,570,302289,226,0001,108,0002,113,536
8Aug 3, 2026 22:0260,107302,970,188293,377,0001,149,0002,113,536
9Aug 3, 2026 22:0260,477304,805,116295,193,0001,146,0002,113,536