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 27, 2025 17:24nnScore: 290,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2025 17:24290,4192,442,434,4572,352,511,00057,963,0002,285,568
2Apr 27, 2025 17:24290,5412,435,500,9452,352,524,00058,963,0002,281,472
3Apr 27, 2025 17:24290,5542,439,054,3962,343,641,00067,960,0002,281,472