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 7, 2026 09:01Kevin HeaveyKevin HeaveyScore: 7,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 09:017,47571,640,81660,837,0001,207,0002,117,632
2Jul 7, 2026 09:017,67573,887,69362,585,0001,123,0002,117,632
3Jul 7, 2026 09:017,68573,260,88462,682,0001,110,0002,117,632
4Jul 7, 2026 09:017,70173,458,82362,791,0001,130,0002,117,632
5Jul 7, 2026 09:017,70673,515,83162,836,0001,129,0002,117,632
6Jul 7, 2026 09:017,73074,192,39263,026,0001,141,0002,117,632
7Jul 7, 2026 09:017,73573,753,09863,082,0001,119,0002,117,632
8Jul 7, 2026 09:017,73573,751,07063,079,0001,122,0002,117,632
9Jul 7, 2026 09:017,84274,597,35363,945,0001,147,0002,117,632