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:36M-RochatM-RochatScore: 19,725Success
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:3719,604180,645,718161,559,0001,160,0002,473,984
2May 5, 2026 16:3719,619181,790,026161,685,0001,159,0002,465,792
3May 5, 2026 16:3719,680178,016,292162,197,0001,147,0002,465,792
4May 5, 2026 16:3719,704183,066,815162,375,0001,170,0002,486,272
5May 5, 2026 16:3719,725177,924,246162,549,0001,174,0002,469,888
6May 5, 2026 16:3719,746178,647,408162,748,0001,150,0002,473,984
7May 5, 2026 16:3719,753180,084,747162,781,0001,169,0002,469,888
8May 5, 2026 16:3719,773180,906,426162,951,0001,170,0002,469,888
9May 5, 2026 16:3719,783187,290,893163,054,0001,149,0002,473,984