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:41Andrew EpsteinAndrew EpsteinScore: 262,357Success
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:42260,0711,284,967,4801,273,233,0001,117,0002,117,632stderr
2Sep 24, 2026 13:42262,2451,295,448,2181,283,901,0001,100,0002,117,632stderr
3Sep 24, 2026 13:42262,3091,295,980,3171,284,204,0001,112,0002,117,632stderr
4Sep 24, 2026 13:42262,3131,295,905,3011,284,225,0001,109,0002,117,632stderr
5Sep 24, 2026 13:42262,3571,296,070,9291,284,459,0001,093,0002,117,632stderr
6Sep 24, 2026 13:42262,4801,296,622,1051,285,033,0001,120,0002,117,632stderr
7Sep 24, 2026 13:42262,9451,299,046,7071,287,318,0001,117,0002,117,632stderr
8Sep 24, 2026 13:42263,9701,303,900,1841,292,331,0001,122,0002,117,632stderr
9Sep 24, 2026 13:42300,6461,483,764,3031,471,942,0001,227,0002,117,632stderr