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:05C#_userC#_userScore: 261,141Success
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:09260,6761,287,103,2571,159,312,000118,003,0002,142,208
2Aug 28, 2026 16:09260,7131,287,246,4081,159,415,000118,081,0002,142,208
3Aug 28, 2026 16:09261,0381,288,756,8781,158,810,000120,279,0002,203,648
4Aug 28, 2026 16:09261,1201,289,258,4401,160,054,000119,434,0002,142,208
5Aug 28, 2026 16:09261,1411,289,249,9631,159,440,000120,152,0002,142,208
6Aug 28, 2026 16:09261,2371,292,192,3891,160,337,000119,728,0002,142,208
7Aug 28, 2026 16:09261,4321,290,748,9011,160,777,000120,241,0002,142,208
8Aug 28, 2026 16:09261,8001,292,536,5871,162,615,000120,209,0002,142,208
9Aug 28, 2026 16:09262,3521,295,168,3161,161,673,000123,854,0002,203,648