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 listJan 9, 2026 20:09Alexander FrolovAlexander FrolovScore: 79,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 20:0979,145682,312,566654,905,0001,999,0002,490,368
2Jan 9, 2026 20:0979,336687,293,819656,488,0001,998,0002,277,376
3Jan 9, 2026 20:0988,974764,762,171737,484,000999,0002,277,376