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 31, 2025 16:40AdityaAdityaScore: 65,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2025 16:4065,179563,465,574539,983,000999,0002,269,184
2Jan 31, 2025 16:4065,203561,489,691540,188,0001,000,0002,404,352
3Jan 31, 2025 16:4065,212567,787,499540,262,0001,000,0002,400,256
4Jan 31, 2025 16:4065,226570,011,978538,371,0003,002,0002,269,184
5Jan 31, 2025 16:4065,255567,258,980541,614,00002,269,184
6Jan 31, 2025 16:4065,292569,644,356540,921,000999,0002,269,184