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 listMar 11, 2026 13:02Advait IyerAdvait IyerScore: 41,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 13:0241,253367,363,707341,402,0001,001,0002,424,832
2Mar 11, 2026 13:0241,335374,429,041339,078,0004,000,0002,420,736
3Mar 11, 2026 13:0241,336367,061,610340,091,0003,000,0002,469,888
4Mar 11, 2026 13:0241,343375,339,775340,150,0003,001,0002,433,024
5Mar 11, 2026 13:0241,351372,320,000341,215,0002,001,0002,428,928
6Mar 11, 2026 13:0241,360368,204,124341,290,0002,001,0002,424,832
7Mar 11, 2026 13:0241,375370,599,453343,409,00002,469,888
8Mar 11, 2026 13:0241,394374,018,190342,574,000998,0002,531,328
9Mar 11, 2026 13:0241,397372,034,695342,597,000998,0002,433,024