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 listJan 3, 2025 18:28Rohan KapurRohan KapurScore: 67,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 18:2867,135577,227,261556,221,0001,000,0002,289,664
2Jan 3, 2025 18:2867,149583,721,125556,337,0001,000,0002,375,680
3Jan 3, 2025 18:2867,219579,003,674555,915,0001,999,0002,375,680