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:26AdityaAdityaScore: 65,179Success
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:2665,091564,003,999538,259,0002,000,0002,519,040
2Jan 31, 2025 16:2665,137570,917,672538,640,0001,998,0002,260,992
3Jan 31, 2025 16:2665,167569,265,573537,883,0002,999,0002,519,040
4Jan 31, 2025 16:2665,172571,138,092537,926,0002,999,0002,519,040
5Jan 31, 2025 16:2665,179567,296,637539,987,000999,0002,387,968
6Jan 31, 2025 16:2665,188569,246,991537,063,0004,000,0002,383,872
7Jan 31, 2025 16:2665,199567,140,414540,149,0001,000,0002,519,040
8Jan 31, 2025 16:2665,203567,579,699539,185,0002,000,0002,519,040
9Jan 31, 2025 16:2665,229570,772,738539,397,0002,001,0002,519,040