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 16, 2024 21:00zielajzielajScore: 3,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 21:003,52550,914,52328,250,0001,008,0002,347,008
2Nov 16, 2024 21:003,56354,294,32028,558,0001,019,0002,342,912
3Nov 16, 2024 21:003,57355,981,97328,638,0001,022,0002,342,912
4Nov 16, 2024 21:003,74355,043,61230,065,0001,002,0002,351,104
5Nov 16, 2024 21:003,74754,466,41029,097,0002,006,0002,531,328
6Nov 16, 2024 21:003,83861,057,09531,859,00002,277,376