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 listMay 27, 2026 14:34flavio87flavio87Score: 5,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2026 14:355,57154,048,88845,221,0001,021,0002,113,536
2May 27, 2026 14:355,58156,137,12245,303,0001,021,0002,113,536
3May 27, 2026 14:355,58354,804,16145,319,0001,022,0002,113,536
4May 27, 2026 14:355,63554,981,62645,750,0001,022,0002,113,536
5May 27, 2026 14:355,66956,624,29546,038,0001,019,0002,113,536
6May 27, 2026 14:355,69557,242,68546,241,0001,031,0002,113,536
7May 27, 2026 14:355,71957,599,64846,451,0001,021,0002,113,536
8May 27, 2026 14:355,72357,933,20345,490,0002,014,0002,113,536
9May 27, 2026 14:355,78357,360,51746,962,0001,040,0002,113,536