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 24, 2026 20:06Victor MerckléVictor MerckléScore: 87,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:0787,492437,220,154426,699,0002,012,0002,117,632stderr
2Aug 24, 2026 20:0787,536437,505,969426,916,0002,015,0002,117,632stderr
3Aug 24, 2026 20:0787,627437,782,865427,197,0002,179,0002,117,632stderr
4Aug 24, 2026 20:0787,675438,002,401427,594,0002,015,0002,117,632stderr
5Aug 24, 2026 20:0787,675438,103,980427,595,0002,015,0002,117,632stderr
6Aug 24, 2026 20:0787,680438,078,551427,612,0002,020,0002,117,632stderr
7Aug 24, 2026 20:0787,699438,181,065427,682,0002,046,0002,117,632stderr
8Aug 24, 2026 20:0787,705438,223,962427,742,0002,015,0002,117,632stderr
9Aug 24, 2026 20:0787,765438,520,944428,025,0002,026,0002,117,632stderr