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 listApr 9, 2024 02:18httpsxhttpsxScore: 325,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2024 02:18322,1482,735,911,8882,673,825,31602,240,512
2Apr 9, 2024 02:18325,0182,754,124,1812,697,650,59302,236,416
3Apr 9, 2024 02:18325,7532,768,161,9772,703,747,94302,240,512