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 20, 2026 05:48M-RochatM-RochatScore: 12,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:4812,456115,387,863101,063,0002,329,0002,113,536
2May 20, 2026 05:4812,460112,934,825101,076,0002,350,0002,113,536
3May 20, 2026 05:4812,465113,101,962101,110,0002,353,0002,113,536
4May 20, 2026 05:4812,466114,867,082101,139,0002,330,0002,113,536
5May 20, 2026 05:4812,468113,480,408101,138,0002,350,0002,113,536
6May 20, 2026 05:4812,502115,447,452101,716,0002,057,0002,113,536
7May 20, 2026 05:4812,503114,130,812101,741,0002,037,0002,113,536
8May 20, 2026 05:4812,564114,670,494102,218,0002,067,0002,113,536
9May 20, 2026 05:4812,619118,251,079102,601,0002,144,0002,113,536