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 listFeb 20, 2026 16:07wnwnScore: 5,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:075,03770,519,35839,815,0001,990,0002,277,376
2Feb 20, 2026 16:075,03864,307,33039,827,0001,991,0002,531,328
3Feb 20, 2026 18:535,03869,601,27639,825,0001,991,0002,498,560
4Feb 20, 2026 18:535,03970,505,68239,834,0001,991,0002,277,376
5Feb 20, 2026 16:075,05070,360,92739,920,0001,996,0002,535,424
6Feb 20, 2026 18:535,06062,006,21939,996,0001,999,0002,277,376