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 13:23Andrew EpsteinAndrew EpsteinScore: 433,863Success
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 13:24433,4012,135,259,4922,122,653,0001,016,0002,117,632stderr
2Sep 24, 2026 13:24433,5012,134,472,6832,123,111,0001,046,0002,117,632stderr
3Sep 24, 2026 13:24433,5502,135,432,4012,123,398,0001,001,0002,117,632stderr
4Sep 24, 2026 13:24433,5872,134,912,4892,123,578,0001,001,0002,117,632stderr
5Sep 24, 2026 13:24433,8632,136,370,2272,124,928,0001,004,0002,117,632stderr
6Sep 24, 2026 13:24434,3022,138,349,3212,127,071,0001,009,0002,117,632stderr
7Sep 24, 2026 13:24440,6732,169,514,3792,126,340,00032,958,0002,117,632stderr
8Sep 24, 2026 13:24440,9802,171,836,8202,126,586,00034,220,0002,117,632stderr
9Sep 24, 2026 13:24441,7742,176,282,8192,131,926,00032,770,0002,117,632stderr