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 listMar 16, 2026 19:32Yuriy LyfenkoYuriy LyfenkoScore: 9,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 19:329,870108,707,67078,923,0002,997,0002,277,376
2Mar 16, 2026 19:329,873112,466,95677,946,0003,997,0002,277,376
3Mar 16, 2026 19:329,890106,456,41279,087,0003,003,0002,265,088