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 listNov 4, 2025 17:52caandocaandoScore: 6,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 17:525,88077,992,33747,810,000996,0002,285,568
2Nov 4, 2025 17:525,92380,971,87947,151,0002,006,0002,285,568
3Nov 4, 2025 17:525,94072,220,61048,297,0001,006,0002,285,568
4Nov 4, 2025 17:526,00080,687,98248,807,000996,0002,273,280
5Nov 4, 2025 17:526,04574,059,46648,167,0002,006,0002,269,184
6Nov 4, 2025 17:526,05586,358,74849,252,0001,005,0002,285,568