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 4, 2026 17:01Josu San MartinJosu San MartinScore: 25,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 17:0125,206131,925,103122,272,0001,241,0002,113,536
2Aug 4, 2026 17:0125,234133,435,409122,371,0001,276,0002,113,536
3Aug 4, 2026 17:0125,234132,067,368122,392,0001,256,0002,113,536
4Aug 4, 2026 17:0125,236132,140,724122,399,0001,258,0002,113,536
5Aug 4, 2026 17:0125,237136,537,949122,398,0001,266,0002,113,536
6Aug 4, 2026 17:0125,268132,184,185122,572,0001,244,0002,113,536
7Aug 4, 2026 17:0125,270132,278,518122,556,0001,267,0002,113,536
8Aug 4, 2026 17:0125,276132,233,099122,602,0001,251,0002,113,536
9Aug 4, 2026 17:0125,641134,019,774124,394,0001,250,0002,113,536