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 17, 2026 01:54M-RochatM-RochatScore: 12,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5512,666113,891,128102,923,0002,208,0002,113,536
2May 17, 2026 01:5512,746114,697,918102,631,0003,164,0002,113,536
3May 17, 2026 01:5512,751116,460,358102,590,0003,244,0002,113,536
4May 17, 2026 01:5512,752115,553,601102,583,0003,261,0002,113,536
5May 17, 2026 01:5512,753114,805,425102,646,0003,209,0002,113,536
6May 17, 2026 01:5512,768114,809,167102,657,0003,323,0002,113,536
7May 17, 2026 01:5512,777116,892,641102,822,0003,235,0002,113,536
8May 17, 2026 01:5512,785115,718,879102,870,0003,247,0002,113,536
9May 17, 2026 01:5512,789116,224,982103,969,0002,180,0002,113,536