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:14C#_userC#_userScore: 193,721Success
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:15192,839955,499,602829,963,000114,950,0002,113,536
2Sep 11, 2026 08:15193,291958,262,575831,775,000115,353,0002,113,536
3Sep 11, 2026 08:15193,305957,523,833830,258,000116,938,0002,113,536
4Sep 11, 2026 08:15193,557958,747,017831,308,000117,123,0002,113,536
5Sep 11, 2026 08:15193,721960,268,647830,947,000118,289,0002,113,536
6Sep 11, 2026 08:15193,903960,679,906834,270,000115,859,0002,113,536
7Sep 11, 2026 08:15194,013961,095,301834,647,000116,020,0002,113,536
8Sep 11, 2026 08:15194,726965,208,184837,797,000116,363,0002,113,536
9Sep 11, 2026 08:15194,814967,290,778837,701,000116,889,0002,113,536