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:55M-RochatM-RochatScore: 12,733Success
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:5612,615115,326,476102,572,0002,135,0002,113,536
2May 17, 2026 01:5612,640116,377,726102,735,0002,184,0002,113,536
3May 17, 2026 01:5612,663116,572,469102,872,0002,236,0002,113,536
4May 17, 2026 01:5612,732116,548,906102,523,0003,153,0002,113,536
5May 17, 2026 01:5612,733116,344,380102,511,0003,180,0002,113,536
6May 17, 2026 01:5612,750116,297,401102,664,0003,166,0002,113,536
7May 17, 2026 01:5612,777115,392,014102,872,0003,181,0002,113,536
8May 17, 2026 01:5612,790116,711,264102,895,0003,270,0002,113,536
9May 17, 2026 01:5612,794116,255,391103,016,0003,180,0002,113,536