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 listOct 9, 2024 02:34MikeMikeScore: 924,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 02:35922,9767,709,278,7167,515,860,000144,843,0002,519,040
2Oct 9, 2024 02:35923,2767,717,661,8787,542,295,000120,892,0002,576,384
3Oct 9, 2024 02:34924,0367,723,952,0627,557,566,000111,934,0002,387,968
4Oct 9, 2024 02:35924,8677,727,994,0637,573,469,000102,924,0002,469,888
5Oct 9, 2024 02:34925,2747,733,767,9587,529,795,000149,976,0002,469,888
6Oct 9, 2024 02:34926,2887,739,671,6647,545,204,000142,984,0002,510,848