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 listOct 3, 2026 21:29Tim RaddatzTim RaddatzScore: 88,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 21:2988,540746,117,217675,334,00059,548,0002,113,536
2Oct 3, 2026 21:2988,549746,206,454675,662,00059,300,0002,113,536
3Oct 3, 2026 21:2988,570745,648,189675,802,00059,336,0002,113,536
4Oct 3, 2026 21:2988,578746,414,683675,857,00059,347,0002,113,536
5Oct 3, 2026 21:2988,584746,474,409675,910,00059,339,0002,113,536
6Oct 3, 2026 21:2988,609746,614,276676,089,00059,369,0002,113,536
7Oct 3, 2026 21:2988,648747,023,784675,459,00060,322,0002,117,632
8Oct 3, 2026 21:2988,661747,111,313675,406,00060,488,0002,113,536
9Oct 3, 2026 21:2988,708748,659,676676,010,00060,272,0002,113,536