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 28, 2026 16:12C#_userC#_userScore: 256,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:16256,2371,265,356,7521,138,436,000117,130,0002,203,648
2Aug 28, 2026 16:16256,3231,268,937,5901,137,849,000118,135,0002,142,208
3Aug 28, 2026 16:16256,4161,266,263,0201,137,906,000118,534,0002,142,208
4Aug 28, 2026 16:16256,6671,267,458,9481,139,040,000118,633,0002,142,208
5Aug 28, 2026 16:16256,6931,267,518,0531,138,753,000119,043,0002,142,208
6Aug 28, 2026 16:16257,4971,271,548,5251,140,274,000121,464,0002,142,208
7Aug 28, 2026 16:16257,4981,271,490,1321,138,657,000123,087,0002,203,648
8Aug 28, 2026 16:16257,6971,272,485,7721,140,604,000122,112,0002,142,208
9Aug 28, 2026 16:16258,7491,277,636,7481,142,082,000125,790,0002,142,208