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 01:09Andrew EpsteinAndrew EpsteinScore: 146,857Success
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 01:10146,833729,963,927718,371,0001,111,0002,117,632stderr
2Sep 25, 2026 01:10146,839730,178,055718,413,0001,100,0002,117,632stderr
3Sep 25, 2026 01:10146,840729,970,671718,415,0001,103,0002,117,632stderr
4Sep 25, 2026 01:10146,846729,989,120718,455,0001,093,0002,117,632stderr
5Sep 25, 2026 01:10146,857730,039,676718,494,0001,108,0002,117,632stderr
6Sep 25, 2026 01:10146,895730,338,189718,678,0001,108,0002,117,632stderr
7Sep 25, 2026 01:10146,896730,385,127718,687,0001,106,0002,117,632stderr
8Sep 25, 2026 01:10146,973730,709,775719,053,0001,119,0002,117,632stderr
9Sep 25, 2026 01:10147,941735,304,413723,792,0001,122,0002,117,632stderr