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 3, 2026 19:55Josu San MartinJosu San MartinScore: 27,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 19:5527,516143,315,197133,566,0001,267,0002,113,536
2Aug 3, 2026 19:5527,533143,348,975133,646,0001,268,0002,113,536
3Aug 3, 2026 19:5527,534143,332,492133,661,0001,260,0002,113,536
4Aug 3, 2026 19:5527,539143,397,696133,687,0001,256,0002,113,536
5Aug 3, 2026 19:5527,547144,190,209133,711,0001,270,0002,113,536
6Aug 3, 2026 19:5527,552143,446,522133,965,0001,043,0002,113,536
7Aug 3, 2026 19:5527,556143,437,423133,755,0001,271,0002,113,536
8Aug 3, 2026 19:5527,593143,595,621133,943,0001,264,0002,113,536
9Aug 3, 2026 19:5527,609143,695,781134,030,0001,255,0002,113,536