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 listFeb 9, 2024 09:55matsuoka-601matsuoka-601Score: 6,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2024 09:556,939119,989,83657,596,92902,207,744
2Feb 9, 2024 09:566,945117,446,43157,640,39702,203,648
3Feb 9, 2024 09:566,962122,840,19857,782,49302,207,744
4Feb 9, 2024 09:556,966116,858,80457,821,77202,195,456
5Feb 9, 2024 09:556,974131,753,23157,885,37002,207,744
6Feb 9, 2024 09:567,286137,979,11960,477,72502,207,744