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 18, 2026 09:58wnwnScore: 7,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 09:586,15972,429,30148,115,0003,007,0002,387,968
2Feb 18, 2026 09:586,24581,800,50448,841,0002,990,0002,355,200
3Feb 18, 2026 09:586,38379,329,25149,983,0002,999,0002,469,888
4Feb 18, 2026 09:587,09185,520,76354,867,0003,990,0002,465,792
5Feb 18, 2026 09:587,24885,422,52657,153,0003,008,0002,457,600
6Feb 18, 2026 09:587,29186,021,24458,501,0002,017,0002,490,368