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:46C#_userC#_userScore: 179,438Success
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:47179,050887,964,325761,792,000115,556,0002,113,536
2Sep 11, 2026 08:47179,106888,060,561762,600,000115,022,0002,113,536
3Sep 11, 2026 08:47179,274889,611,592762,476,000115,967,0002,113,536
4Sep 11, 2026 08:47179,338889,122,478763,001,000115,759,0002,113,536
5Sep 11, 2026 08:47179,438890,260,355762,140,000117,110,0002,113,536
6Sep 11, 2026 08:47179,439889,948,427762,973,000116,279,0002,113,536
7Sep 11, 2026 08:47179,445889,719,383762,391,000116,893,0002,113,536
8Sep 11, 2026 08:47179,510890,066,008762,532,000117,071,0002,113,536
9Sep 11, 2026 08:47179,634891,931,171763,112,000117,098,0002,113,536