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 30, 2026 17:50Karthik ReddyKarthik ReddyScore: 3,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 17:503,43337,446,74527,488,0001,014,0002,113,536
2Sep 30, 2026 17:503,43537,453,38327,476,0001,037,0002,113,536
3Sep 30, 2026 17:503,44137,572,28927,551,0001,016,0002,113,536
4Sep 30, 2026 17:503,44637,523,65827,576,0001,030,0002,113,536
5Sep 30, 2026 17:503,44637,495,36427,563,0001,039,0002,113,536
6Sep 30, 2026 17:503,44737,497,65027,580,0001,038,0002,113,536
7Sep 30, 2026 17:503,44737,555,52827,598,0001,020,0002,113,536
8Sep 30, 2026 17:503,44837,521,72427,598,0001,023,0002,113,536
9Sep 30, 2026 17:503,45437,599,71327,638,0001,033,0002,113,536