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 listJun 17, 2026 09:18DavidDavidScore: 180,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 09:19180,1451,502,768,3271,437,294,00057,917,0002,113,536
2Jun 17, 2026 09:19180,2121,503,122,7711,437,521,00058,246,0002,113,536
3Jun 17, 2026 09:19180,2401,503,475,1791,437,478,00058,515,0002,113,536
4Jun 17, 2026 09:19180,2701,503,675,8451,437,576,00058,668,0002,113,536
5Jun 17, 2026 09:19180,2831,503,711,8441,437,678,00058,674,0002,113,536
6Jun 17, 2026 09:19180,3261,504,262,3331,437,574,00059,134,0002,113,536
7Jun 17, 2026 09:19180,3261,504,238,7211,437,433,00059,280,0002,113,536
8Jun 17, 2026 09:19180,3681,504,586,4201,437,738,00059,324,0002,113,536
9Jun 17, 2026 09:19180,4601,505,652,1801,437,530,00060,290,0002,113,536