Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 28, 2026 20:01Victor MerckléVictor MerckléScore: 4,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:024,80348,841,33738,848,0001,019,0002,113,536
2Aug 28, 2026 20:024,80648,860,98638,859,0001,036,0002,113,536
3Aug 28, 2026 20:024,81049,016,56638,907,0001,019,0002,113,536
4Aug 28, 2026 20:024,81348,251,90238,937,0001,019,0002,113,536
5Aug 28, 2026 20:024,81448,863,62138,942,0001,019,0002,113,536
6Aug 28, 2026 20:024,81849,055,36938,961,0001,035,0002,113,536
7Aug 28, 2026 20:024,84449,198,83939,187,0001,020,0002,113,536
8Aug 28, 2026 20:024,84849,300,24339,217,0001,023,0002,113,536
9Aug 28, 2026 20:024,86449,423,75539,335,0001,039,0002,113,536