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 listMar 6, 2026 17:46Josu San MartinJosu San MartinScore: 5,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 17:465,25971,174,83542,635,0001,015,0002,293,760
2Mar 6, 2026 17:465,27770,201,20242,801,000995,0002,494,464
3Mar 6, 2026 17:465,35670,846,94043,444,0001,010,0002,285,568
4Mar 6, 2026 17:465,44868,307,21243,208,0002,009,0002,506,752
5Mar 6, 2026 17:465,50576,874,61044,673,0001,015,0002,273,280
6Mar 6, 2026 17:465,53969,551,69242,979,0002,998,0002,523,136