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 13:41Alexander FrolovAlexander FrolovScore: 101,509Success
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 13:41100,325862,431,439830,701,0001,999,0002,277,376
2Jan 9, 2026 13:41101,509865,923,204840,530,0001,998,0002,269,184
3Jan 9, 2026 13:41101,539863,574,099841,774,000999,0002,277,376