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 18, 2026 16:55wnwnScore: 4,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 16:554,19761,865,06433,843,000995,0002,535,424
2Apr 18, 2026 16:544,20759,974,96932,924,0001,995,0002,277,376
3Apr 18, 2026 16:544,21462,855,97432,978,0001,998,0002,277,376
4Apr 18, 2026 16:544,21957,133,25733,014,0002,000,0002,277,376
5Apr 18, 2026 16:554,24161,711,99733,193,0002,011,0002,277,376
6Apr 18, 2026 16:554,28160,247,65234,516,0001,015,0002,490,368