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 listFeb 13, 2026 20:19Krishn ParasarKrishn ParasarScore: 84,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 20:1984,049719,387,964623,648,00073,958,0002,273,280
2Feb 13, 2026 20:1984,061720,676,161638,734,00058,975,0002,273,280
3Feb 13, 2026 20:1984,082720,164,276633,894,00063,989,0002,371,584
4Feb 13, 2026 20:1984,129719,672,135641,246,00057,021,0002,379,776
5Feb 13, 2026 20:1984,196722,633,547636,845,00061,984,0002,273,280
6Feb 13, 2026 20:1984,254729,358,105633,279,00066,029,0002,273,280
7Feb 13, 2026 20:1984,358724,884,806636,158,00064,015,0002,273,280
8Feb 13, 2026 20:1984,368726,458,720641,231,00059,021,0002,273,280
9Feb 13, 2026 20:1984,559724,331,392632,853,00068,984,0002,273,280