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 18, 2026 20:28Joel SmithJoel SmithScore: 62,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 20:2862,930547,653,668521,316,0001,000,0002,273,280
2Mar 18, 2026 20:2862,944555,010,241521,437,0001,000,0002,273,280
3Mar 18, 2026 20:2862,951553,938,545520,492,0002,001,0002,269,184
4Mar 18, 2026 20:2862,968550,593,696520,638,0001,998,0002,269,184
5Mar 18, 2026 20:2862,982545,724,808519,755,0002,998,0002,273,280
6Mar 18, 2026 20:2862,990545,054,661521,818,000999,0002,260,992
7Mar 18, 2026 20:2863,000550,063,272520,905,0001,999,0002,371,584
8Mar 18, 2026 20:2863,003550,176,539521,924,000999,0002,273,280
9Mar 18, 2026 20:2863,042546,579,435521,246,0002,000,0002,273,280