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 listJul 20, 2026 20:23PaulPaulScore: 129,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 20:25129,5271,086,868,9011,017,623,00057,456,0002,138,112
2Jul 20, 2026 20:25129,5981,086,282,3391,018,241,00057,425,0002,138,112
3Jul 20, 2026 20:25129,7631,087,667,3701,018,607,00058,432,0002,138,112
4Jul 20, 2026 20:25129,9501,089,335,3861,020,132,00058,459,0002,138,112
5Jul 20, 2026 20:25129,9821,090,254,6731,021,464,00057,389,0002,138,112
6Jul 20, 2026 20:25130,0081,090,203,6021,020,631,00058,438,0002,138,112
7Jul 20, 2026 20:25130,0691,090,810,7851,023,129,00056,444,0002,138,112
8Jul 20, 2026 20:25130,2401,091,796,1461,023,557,00057,437,0002,138,112
9Jul 20, 2026 20:25130,3451,092,853,8481,024,253,00057,611,0002,138,112