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 01:36Josu San MartinJosu San MartinScore: 160,938Success
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 01:36160,916812,238,573785,488,0002,998,0002,539,520
2Jan 17, 2026 01:36160,920819,922,571787,510,000999,0002,359,296
3Jan 17, 2026 01:36160,925813,823,980785,533,0002,998,0002,359,296
4Jan 17, 2026 01:36160,937815,248,981785,592,0002,998,0002,371,584
5Jan 17, 2026 01:36160,938814,536,897785,597,0002,998,0002,523,136
6Jan 17, 2026 01:36160,944817,427,325786,628,0001,999,0002,531,328
7Jan 17, 2026 01:36160,945819,058,833785,633,0002,998,0002,383,872
8Jan 17, 2026 01:36160,952810,993,554785,667,0002,998,0002,359,296
9Jan 17, 2026 01:36161,105819,461,456789,413,00002,519,040