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:53Josu San MartinJosu San MartinScore: 27,928Success
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:5327,860145,092,734135,258,0001,259,0002,113,536
2Aug 3, 2026 19:5327,895145,151,494135,440,0001,246,0002,113,536
3Aug 3, 2026 19:5327,923145,238,264135,564,0001,263,0002,113,536
4Aug 3, 2026 19:5327,924145,280,577135,566,0001,265,0002,113,536
5Aug 3, 2026 19:5327,928145,390,972135,593,0001,256,0002,113,536
6Aug 3, 2026 19:5327,931145,089,773135,591,0001,275,0002,113,536
7Aug 3, 2026 19:5327,973145,515,374136,046,0001,022,0002,113,536
8Aug 3, 2026 19:5328,340147,346,917137,605,0001,263,0002,113,536
9Aug 3, 2026 19:5328,577148,463,008139,021,0001,008,0002,113,536