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 14, 2024 16:45Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:4500000Error: expected "53680820110183677 ", got "53680825682227319 "stderr
2Oct 14, 2024 16:4500000Error: No answer to stdout. Died or killed?stderr
3Oct 14, 2024 16:454,31861,855,12834,844,000995,0002,306,048
4Oct 14, 2024 16:454,31960,225,28433,860,0001,991,0002,502,656
5Oct 14, 2024 16:454,31961,006,23934,855,000995,0002,306,048
6Oct 14, 2024 16:454,33061,387,20332,944,0002,994,0002,273,280
7Oct 14, 2024 16:454,38056,118,73235,345,0001,009,0002,269,184
8Oct 14, 2024 16:454,40762,278,77835,561,0001,016,0002,531,328
9Oct 14, 2024 16:454,43867,306,32135,844,000995,0002,531,328
10Oct 14, 2024 16:454,44059,344,66536,850,00002,428,928
11Oct 14, 2024 16:454,44463,301,89734,895,0001,994,0002,301,952