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:06Karthik ReddyKarthik ReddyScore: 7,516Success
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:077,44071,945,50860,599,0001,155,0002,113,536
2Sep 25, 2026 06:077,47072,178,96460,858,0001,144,0002,113,536
3Sep 25, 2026 06:077,51072,592,43961,197,0001,136,0002,113,536
4Sep 25, 2026 06:077,51672,574,21961,243,0001,142,0002,113,536
5Sep 25, 2026 06:077,51672,565,78161,248,0001,142,0002,113,536
6Sep 25, 2026 06:077,51972,620,82861,266,0001,147,0002,113,536
7Sep 25, 2026 06:077,52672,788,61561,335,0001,139,0002,113,536
8Sep 25, 2026 06:077,52673,891,98561,333,0001,138,0002,113,536
9Sep 25, 2026 06:077,53672,813,12861,425,0001,132,0002,113,536