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 19, 2026 21:21lipapipalipapipaScore: 5,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:215,78669,318,64646,021,0002,000,0002,453,504
2Feb 19, 2026 21:215,88475,843,10346,843,0001,993,0002,486,272
3Feb 19, 2026 21:215,89073,861,53845,891,0002,992,0002,449,408
4Feb 19, 2026 21:215,91872,188,79247,115,0002,004,0002,285,568
5Feb 19, 2026 21:215,97477,587,13647,558,0002,023,0002,334,720
6Feb 19, 2026 21:216,01171,899,78346,897,0002,993,0002,523,136