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 listMay 10, 2026 10:57wnwnScore: 3,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:583,50445,729,32628,038,0001,049,0002,486,272
2May 10, 2026 10:583,52147,198,11828,168,0001,063,0002,486,272
3May 10, 2026 10:583,54545,355,95528,353,0001,071,0002,490,368
4May 10, 2026 10:583,54743,197,15428,400,0001,047,0002,482,176
5May 10, 2026 10:583,65747,096,74329,285,0001,074,0002,490,368
6May 10, 2026 10:583,69345,747,17829,591,0001,065,0002,469,888
7May 10, 2026 10:583,70449,589,87329,670,0001,078,0002,490,368
8May 10, 2026 10:583,70546,326,09429,604,0001,153,0002,486,272
9May 10, 2026 10:583,71647,689,10629,763,0001,087,0002,486,272