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 3, 2026 16:19Carlos MGCarlos MGScore: 75,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 16:1975,092650,246,721622,265,0001,000,0002,289,664
2Jan 3, 2026 16:1975,107650,166,548623,387,00002,469,888
3Jan 3, 2026 16:1975,109650,196,248623,406,00002,355,200
4Jan 3, 2026 16:1975,120650,931,373621,497,0001,998,0002,289,664
5Jan 3, 2026 16:1975,123648,188,338622,523,000999,0002,355,200
6Jan 3, 2026 16:1975,126661,411,276623,547,00002,289,664
7Jan 3, 2026 16:1975,126649,672,491623,542,00002,342,912
8Jan 3, 2026 16:1975,128648,473,515622,565,000999,0002,359,296
9Jan 3, 2026 16:1975,134653,555,348621,614,0001,998,0002,359,296