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 listFeb 5, 2026 20:46BenzotoporBenzotoporScore: 49,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 20:4649,312437,428,829409,290,00002,289,664
2Feb 5, 2026 20:4649,313431,815,777409,300,00002,289,664
3Feb 5, 2026 20:4649,319438,087,261408,347,0001,000,0002,269,184
4Feb 5, 2026 20:4649,355442,987,893408,644,000999,0002,281,472
5Feb 5, 2026 20:4649,356440,180,765407,656,0001,998,0002,519,040
6Feb 5, 2026 20:4649,356440,682,823408,652,000999,0002,510,848
7Feb 5, 2026 20:4649,366433,713,021408,739,000999,0002,289,664
8Feb 5, 2026 20:4649,370431,188,766407,776,0001,998,0002,289,664
9Feb 5, 2026 20:4649,395438,742,631407,978,0001,999,0002,273,280