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 04:38Andrew EpsteinAndrew EpsteinScore: 184,663Success
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 04:38184,567914,937,184903,278,0001,105,0002,117,632stderr
2Sep 25, 2026 04:38184,590915,011,368903,383,0001,109,0002,117,632stderr
3Sep 25, 2026 04:38184,657915,509,694903,706,0001,118,0002,117,632stderr
4Sep 25, 2026 04:38184,663916,074,008903,737,0001,116,0002,117,632stderr
5Sep 25, 2026 04:38184,663916,107,218903,739,0001,114,0002,117,632stderr
6Sep 25, 2026 04:38184,687916,275,852903,852,0001,115,0002,117,632stderr
7Sep 25, 2026 04:38184,719915,660,051904,004,0001,123,0002,117,632stderr
8Sep 25, 2026 04:38184,764916,090,950903,169,0002,177,0002,117,632stderr
9Sep 25, 2026 04:38184,931916,661,326905,046,0001,118,0002,117,632stderr