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 listOct 13, 2026 02:11Karthik ReddyKarthik ReddyScore: 23,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 02:1223,228122,723,875112,779,0001,040,00020,480
2Oct 13, 2026 02:1223,264122,978,950112,935,0001,061,00020,480
3Oct 13, 2026 02:1223,265124,338,747112,943,0001,059,00020,480
4Oct 13, 2026 02:1223,297123,114,044113,098,0001,059,00020,480
5Oct 13, 2026 02:1223,327123,909,095113,255,0001,049,00020,480
6Oct 13, 2026 02:1223,328123,233,653113,253,0001,057,00020,480
7Oct 13, 2026 02:1223,353123,320,123113,427,0001,005,00020,480
8Oct 13, 2026 02:1223,364123,419,356113,391,0001,093,00020,480
9Oct 13, 2026 02:1223,372123,470,883113,464,0001,060,00020,480