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 00:58Andrew EpsteinAndrew EpsteinScore: 178,100Success
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 00:58178,009882,710,004871,144,0001,101,0002,117,632stderr
2Sep 25, 2026 00:58178,060882,979,628871,370,0001,126,0002,117,632stderr
3Sep 25, 2026 00:58178,065883,099,316871,401,0001,122,0002,117,632stderr
4Sep 25, 2026 00:58178,078883,058,185871,460,0001,123,0002,117,632stderr
5Sep 25, 2026 00:58178,100883,263,267871,484,0001,207,0002,117,632stderr
6Sep 25, 2026 00:58178,103883,224,812871,604,0001,103,0002,117,632stderr
7Sep 25, 2026 00:58178,155883,538,940870,841,0002,123,0002,117,632stderr
8Sep 25, 2026 00:58178,205883,727,360872,094,0001,112,0002,117,632stderr
9Sep 25, 2026 00:58178,483885,304,483871,277,0003,290,0002,117,632stderr