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 listJul 29, 2024 13:47darksidersstrifedarksidersstrifeScore: 95,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2024 13:4693,365846,943,872774,929,32702,265,088
2Jul 29, 2024 13:4693,404830,037,790775,256,76702,379,776
3Jul 29, 2024 13:4693,461831,632,587775,728,80002,387,968
4Jul 29, 2024 13:4795,638858,118,621793,796,68502,383,872
5Jul 29, 2024 13:4795,663861,430,099794,004,13202,252,800
6Jul 29, 2024 13:4795,741861,795,503794,651,50202,392,064