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 listJun 5, 2024 11:13matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2024 11:1300000Error: expected "53685961814670201 ", got "94442127713157421"
2Jun 5, 2024 11:1300000Error: expected "53687825687367442 ", got "69376932973125330"
3Jun 5, 2024 11:1400000Error: No answer to stdout. Died or killed?
4Jun 5, 2024 12:0900000Error: expected "53686993027211042 ", got "99461267141285345"
5Jun 5, 2024 11:146,049114,746,65450,205,67802,256,896
6Jun 5, 2024 11:146,053114,414,34750,241,29002,240,512
7Jun 5, 2024 11:156,067122,452,61050,355,42802,240,512
8Jun 5, 2024 11:156,070117,020,25450,383,26102,244,608
9Jun 5, 2024 11:146,109123,377,46250,702,91002,375,680
10Jun 5, 2024 11:156,116124,797,52950,761,05602,240,512