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 listSep 25, 2026 06:09Karthik ReddyKarthik ReddyScore: 7,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 06:107,49873,645,73061,106,0001,129,0002,113,536
2Sep 25, 2026 06:107,56073,044,37861,612,0001,137,0002,113,536
3Sep 25, 2026 06:107,57273,199,25861,681,0001,173,0002,113,536
4Sep 25, 2026 06:107,58773,193,62761,841,0001,136,0002,113,536
5Sep 25, 2026 06:107,63973,760,74362,241,0001,167,0002,113,536
6Sep 25, 2026 06:107,66573,944,94162,493,0001,130,0002,113,536
7Sep 25, 2026 06:107,73074,402,45963,038,0001,129,0002,113,536
8Sep 25, 2026 06:107,73674,490,92163,079,0001,138,0002,113,536
9Sep 25, 2026 06:107,75174,620,24063,284,0001,051,0002,113,536