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 listAug 18, 2025 13:06Ashish AhujaAshish AhujaScore: 11,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:0610,924123,278,36683,692,0006,974,0002,473,984
2Aug 18, 2025 13:0610,924116,775,46881,703,0008,967,0002,531,328
3Aug 18, 2025 13:0610,997114,310,95987,260,0004,011,0002,527,232
4Aug 18, 2025 13:0611,025117,770,26383,553,0007,957,0002,392,064
5Aug 18, 2025 13:0611,031118,308,98784,591,0006,966,0002,523,136
6Aug 18, 2025 13:0611,068120,362,30385,876,0005,991,0002,539,520