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 listAug 3, 2026 03:49Victor MerckléVictor MerckléScore: 29,259Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 03:5029,052150,798,892141,349,0001,010,0002,117,632stderr
2Aug 3, 2026 03:5029,094150,954,403141,552,0001,010,0002,117,632stderr
3Aug 3, 2026 03:5029,180151,403,445141,976,0001,010,0002,117,632stderr
4Aug 3, 2026 03:5029,229151,665,402141,208,0002,017,0002,117,632stderr
5Aug 3, 2026 03:5029,259151,722,135142,363,0001,009,0002,117,632stderr
6Aug 3, 2026 03:5029,305152,033,191141,589,0002,010,0002,117,632stderr
7Aug 3, 2026 03:5029,401152,500,178142,041,0002,026,0002,117,632stderr
8Aug 3, 2026 03:5029,500152,955,558143,543,0001,010,0002,117,632stderr
9Aug 3, 2026 03:5029,533153,349,217143,705,0001,009,0002,117,632stderr