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 listApr 19, 2026 01:31wnwnScore: 4,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 01:324,08356,465,42731,897,0001,993,0002,269,184
2Apr 19, 2026 01:324,08857,223,34631,934,0001,995,0002,531,328
3Apr 19, 2026 01:314,09157,264,87831,957,0001,997,0002,494,464
4Apr 19, 2026 01:324,09355,055,76031,975,0001,998,0002,531,328
5Apr 19, 2026 01:314,16756,115,37733,568,0001,017,0002,494,464
6Apr 19, 2026 01:314,19761,853,28933,843,000995,0002,527,232