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 listSep 11, 2026 08:25C#_userC#_userScore: 179,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 08:25179,128888,873,876761,485,000116,247,0002,113,536
2Sep 11, 2026 08:25179,205889,292,426762,154,000115,954,0002,113,536
3Sep 11, 2026 08:25179,216888,782,363761,434,000116,727,0002,113,536
4Sep 11, 2026 08:25179,234888,560,010762,276,000115,971,0002,113,536
5Sep 11, 2026 08:25179,293888,991,927762,053,000116,483,0002,113,536
6Sep 11, 2026 08:25179,312889,682,467762,368,000116,265,0002,113,536
7Sep 11, 2026 08:25179,319889,139,169762,360,000116,305,0002,113,536
8Sep 11, 2026 08:25179,337889,402,976761,490,000117,265,0002,113,536
9Sep 11, 2026 08:25179,606891,284,649764,764,000115,306,0002,113,536