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 2, 2026 21:52javivallejojavivallejoScore: 57,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 21:5257,604503,570,948478,115,00002,523,136
2Feb 2, 2026 21:5257,617502,530,822477,217,0001,000,0002,289,664
3Feb 2, 2026 21:5257,679503,713,377476,740,0001,998,0002,269,184