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 16:24Kevin HeaveyKevin HeaveyScore: 26,198Success
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 16:2526,177138,688,236127,159,0001,111,00020,480
2Sep 23, 2026 16:2526,194138,765,734127,236,0001,117,00020,480
3Sep 23, 2026 16:2526,195138,923,307127,237,0001,122,00020,480
4Sep 23, 2026 16:2526,196138,749,036127,255,0001,107,00020,480
5Sep 23, 2026 16:2526,198139,473,957127,254,0001,117,00020,480
6Sep 23, 2026 16:2526,203139,591,190127,276,0001,123,00020,480
7Sep 23, 2026 16:2526,213138,842,590127,326,0001,122,00020,480
8Sep 23, 2026 16:2526,238139,640,342127,452,0001,119,00020,480
9Sep 23, 2026 16:2526,286139,203,226127,696,0001,107,00020,480