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 listJan 17, 2026 04:35Josu San MartinJosu San MartinScore: 152,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 04:35150,589765,883,080734,886,0002,999,0002,281,472
2Jan 17, 2026 04:35150,703761,033,986736,445,0001,998,0002,437,120
3Jan 17, 2026 04:35151,346766,254,783739,595,0001,998,0002,330,624
4Jan 17, 2026 04:35151,939774,143,318741,505,0002,998,0002,281,472
5Jan 17, 2026 04:35152,479777,730,659745,149,0002,000,0002,433,024
6Jan 17, 2026 04:35152,956772,612,827746,488,0002,997,0002,281,472
7Jan 17, 2026 04:35153,020776,959,709746,801,0002,999,0002,285,568
8Jan 17, 2026 04:35153,554781,462,693750,418,0001,998,0002,342,912
9Jan 17, 2026 04:35154,227782,570,800753,715,0001,999,0002,281,472