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 listSep 25, 2026 17:08Andrew EpsteinAndrew EpsteinScore: 211,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 17:09211,3211,046,015,8951,034,372,0001,103,0002,117,632stderr
2Sep 25, 2026 17:09211,3281,046,141,2681,034,400,0001,110,0002,117,632stderr
3Sep 25, 2026 17:09211,3281,046,075,2591,034,410,0001,101,0002,117,632stderr
4Sep 25, 2026 17:09211,3401,046,085,8631,034,458,0001,112,0002,117,632stderr
5Sep 25, 2026 17:09211,3431,046,235,3191,034,471,0001,112,0002,117,632stderr
6Sep 25, 2026 17:09211,3901,046,878,2591,033,701,0002,112,0002,117,632stderr
7Sep 25, 2026 17:09211,4151,046,540,0321,034,826,0001,109,0002,117,632stderr
8Sep 25, 2026 17:09211,4331,047,261,2971,034,902,0001,123,0002,117,632stderr
9Sep 25, 2026 17:09211,4951,047,584,4141,035,221,0001,108,0002,117,632stderr