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 24, 2026 15:50Andrew EpsteinAndrew EpsteinScore: 198,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:51197,134976,454,111964,848,0001,109,0002,117,632stderr
2Sep 24, 2026 15:51197,157976,646,934964,950,0001,120,0002,117,632stderr
3Sep 24, 2026 15:51197,199976,752,142965,180,0001,096,0002,117,632stderr
4Sep 24, 2026 15:51197,379977,747,554966,046,0001,114,0002,117,632stderr
5Sep 24, 2026 15:51198,103981,227,912969,597,0001,109,0002,117,632stderr
6Sep 24, 2026 15:51198,237981,928,445970,250,0001,113,0002,117,632stderr
7Sep 24, 2026 15:51198,485983,826,258971,456,0001,121,0002,117,632stderr
8Sep 24, 2026 15:51198,485983,203,278971,469,0001,110,0002,117,632stderr
9Sep 24, 2026 15:51198,590984,606,928970,868,0002,225,0002,117,632stderr