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 listMay 5, 2026 16:30M-RochatM-RochatScore: 19,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:3019,765180,365,788162,884,0001,167,0002,465,792
2May 5, 2026 16:3019,835180,206,590163,469,0001,168,0002,469,888
3May 5, 2026 16:3019,846179,760,491163,573,0001,150,0002,473,984
4May 5, 2026 16:3019,889180,127,049163,911,0001,170,0002,461,696
5May 5, 2026 16:3019,987182,407,756164,751,0001,144,0002,469,888
6May 5, 2026 16:3020,054182,038,383165,314,0001,141,0002,469,888
7May 5, 2026 16:3020,075183,995,488165,477,0001,146,0002,473,984
8May 5, 2026 16:3020,512189,237,110169,079,0001,176,0002,469,888
9May 5, 2026 16:3020,520188,827,548169,140,0001,177,0002,469,888