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:20anboto1anboto1Score: 57,383Success
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:2057,189288,704,716279,115,0001,115,0002,113,536
2Aug 3, 2026 22:2057,190288,705,785279,138,0001,093,0002,113,536
3Aug 3, 2026 22:2057,210288,794,846279,239,0001,093,0002,113,536
4Aug 3, 2026 22:2057,235289,591,704279,373,0001,081,0002,113,536
5Aug 3, 2026 22:2057,383290,273,811280,078,0001,103,0002,113,536
6Aug 3, 2026 22:2057,425289,797,637280,228,0001,158,0002,113,536
7Aug 3, 2026 22:2057,542290,397,046280,867,0001,091,0002,113,536
8Aug 3, 2026 22:2057,759291,500,280281,926,0001,096,0002,113,536
9Aug 3, 2026 22:2058,735296,334,763286,704,0001,100,0002,113,536