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 23, 2026 15:49Kevin HeaveyKevin HeaveyScore: 26,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 15:5026,259139,153,352127,559,0001,111,00020,480
2Sep 23, 2026 15:5026,268139,135,089127,603,0001,114,00020,480
3Sep 23, 2026 15:5026,269139,109,941127,628,0001,094,00020,480
4Sep 23, 2026 15:5026,271140,001,077127,610,0001,120,00020,480
5Sep 23, 2026 15:5026,278139,198,278127,658,0001,108,00020,480
6Sep 23, 2026 15:5026,281139,165,789127,650,0001,129,00020,480
7Sep 23, 2026 15:5026,288139,915,675127,689,0001,126,00020,480
8Sep 23, 2026 15:5026,308139,435,401127,801,0001,113,00020,480
9Sep 23, 2026 15:5026,313139,320,372127,823,0001,115,00020,480