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 listAug 29, 2026 16:50Josu San MartinJosu San MartinScore: 4,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 16:534,71847,640,21138,040,0001,121,0002,113,536
2Aug 29, 2026 16:534,71947,681,29938,127,0001,043,0002,113,536
3Aug 29, 2026 16:534,73347,733,07638,154,0001,131,0002,113,536
4Aug 29, 2026 16:534,73447,778,56538,162,0001,132,0002,113,536
5Aug 29, 2026 16:534,73547,751,63638,161,0001,140,0002,113,536
6Aug 29, 2026 16:534,74048,010,55338,289,0001,054,0002,113,536
7Aug 29, 2026 16:534,74947,868,37638,298,0001,123,0002,113,536
8Aug 29, 2026 16:534,75347,891,78138,312,0001,142,0002,113,536
9Aug 29, 2026 16:534,75347,923,88538,396,0001,055,0002,113,536