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 20:33zielajzielajScore: 3,565Success
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 20:333,52552,561,64028,251,0001,008,0002,342,912
2Nov 16, 2024 20:333,53358,003,50727,306,0002,022,0002,527,232
3Nov 16, 2024 20:333,53649,611,51328,337,0001,012,0002,342,912
4Nov 16, 2024 20:333,55356,395,77428,476,0001,017,0002,523,136
5Nov 16, 2024 20:333,56251,464,43129,565,00002,527,232
6Nov 16, 2024 20:333,56561,671,65428,570,0001,020,0002,347,008
7Nov 16, 2024 20:333,56560,983,23429,590,00002,523,136
8Nov 16, 2024 20:333,57054,253,18228,609,0001,021,0002,347,008
9Nov 16, 2024 20:333,57156,389,24429,636,00002,351,104
10Nov 16, 2024 20:333,74654,420,17630,088,0001,002,0002,351,104
11Nov 16, 2024 20:333,79461,557,94131,488,00002,531,328
12Nov 16, 2024 20:333,83760,203,97030,856,000995,0002,363,392