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 16:40Andrew EpsteinAndrew EpsteinScore: 181,647Success
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 16:41180,971897,218,306877,392,0009,367,0002,117,632stderr
2Sep 25, 2026 16:41180,973897,650,809878,070,0008,698,0002,117,632stderr
3Sep 25, 2026 16:41181,305899,665,369877,547,00010,850,0002,117,632stderr
4Sep 25, 2026 16:41181,393899,312,256877,632,00011,194,00024,576stderr
5Sep 25, 2026 16:41181,647900,833,438877,453,00012,619,0002,117,632stderr
6Sep 25, 2026 16:41182,004902,437,819877,930,00013,891,00024,576stderr
7Sep 25, 2026 16:41182,857907,430,211877,596,00018,406,0002,117,632stderr
8Sep 25, 2026 16:41183,166908,060,219877,637,00019,878,0002,117,632stderr
9Sep 25, 2026 16:41183,402909,139,562877,981,00020,690,0002,117,632stderr