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 24, 2026 16:03Alexander FrolovAlexander FrolovScore: 168,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 24, 2026 16:03168,5441,422,912,7411,397,917,000999,0002,277,376
2Jan 24, 2026 16:03168,5651,427,764,9261,397,093,0001,998,0002,277,376
3Jan 24, 2026 16:03168,6081,421,779,0291,397,444,0001,999,0002,277,376