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 10, 2026 12:59Satyajeet SindhiyaniSatyajeet SindhiyaniScore: 64,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 12:5964,121561,193,915532,203,00002,400,256
2Feb 10, 2026 12:5964,148561,935,687530,429,0001,997,0002,277,376
3Feb 10, 2026 12:5964,160563,363,620531,526,000999,0002,277,376
4Feb 10, 2026 12:5964,164557,735,943531,559,000999,0002,273,280
5Feb 10, 2026 12:5964,167568,217,788532,587,00002,396,160
6Feb 10, 2026 12:5964,169565,021,327531,605,000999,0002,273,280
7Feb 10, 2026 12:5964,175558,709,536531,656,000999,0002,277,376
8Feb 10, 2026 12:5964,181557,654,284531,702,000999,0002,277,376
9Feb 10, 2026 12:5964,248555,733,278533,260,00002,404,352