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 18:36AVGAVGScore: 44,542Success
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 18:3644,480389,257,857368,184,0001,000,0002,269,184
2Jan 9, 2026 18:3644,491397,203,336368,273,0001,000,0002,269,184
3Jan 9, 2026 18:3644,506399,695,331366,401,0002,995,0002,269,184
4Jan 9, 2026 18:3644,518397,029,710368,499,0001,001,0002,269,184
5Jan 9, 2026 18:3644,542395,830,836369,698,00002,273,280
6Jan 9, 2026 18:3644,542396,967,357367,698,0001,998,0002,269,184
7Jan 9, 2026 18:3644,550392,977,494366,769,0002,998,0002,396,160
8Jan 9, 2026 18:3644,559391,693,451365,840,0003,998,0002,396,160
9Jan 9, 2026 18:3644,574389,945,460367,963,0001,999,0002,392,064