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 22, 2024 02:07zielajzielajScore: 7,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2024 02:063,70751,680,11929,774,000992,0002,379,776
2Nov 22, 2024 02:063,72055,769,07028,885,0001,992,0002,523,136
3Nov 22, 2024 02:063,73157,649,70827,970,0002,996,0002,367,488
4Nov 22, 2024 02:063,86760,178,92128,082,0004,011,0002,392,064
5Nov 22, 2024 02:063,86755,920,95330,087,0002,005,0002,387,968
6Nov 22, 2024 02:063,90953,450,16232,445,00002,392,064
7Nov 22, 2024 02:077,15080,012,94258,344,0001,005,0002,363,392
8Nov 22, 2024 02:077,20988,094,63957,837,0001,994,0002,379,776
9Nov 22, 2024 02:077,23781,320,46458,064,0002,002,0002,269,184
10Nov 22, 2024 02:077,52582,207,77262,461,00002,379,776
11Nov 22, 2024 02:077,57087,551,91060,838,0001,994,0002,379,776
12Nov 22, 2024 02:077,60788,672,55161,133,0002,004,0002,383,872