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 listJul 2, 2026 08:46A_ShamanA_ShamanScore: 136,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 08:46136,763680,699,541666,139,0004,000,0002,146,304
2Jul 2, 2026 08:46136,768680,283,624666,169,0003,999,0002,146,304
3Jul 2, 2026 08:46136,798680,793,562666,315,0003,998,0002,146,304
4Jul 2, 2026 08:46136,810680,792,288666,372,0003,998,0002,146,304
5Jul 2, 2026 08:46136,818680,893,081666,403,0004,008,0002,146,304
6Jul 2, 2026 08:46136,827680,620,190666,458,0003,996,0002,146,304
7Jul 2, 2026 08:46136,839681,066,938666,517,0003,997,0002,146,304
8Jul 2, 2026 08:46136,860680,856,411666,617,0003,997,0002,146,304
9Jul 2, 2026 08:46136,901681,262,106666,818,0003,997,0002,146,304