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 2, 2026 15:57Priyansh RathiPriyansh RathiScore: 41,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:5741,399380,584,698342,610,000998,0002,359,296
2Mar 2, 2026 15:5741,441376,638,718339,964,0003,999,0002,359,296
3Mar 2, 2026 15:5741,679378,307,825343,933,0001,999,0002,359,296
4Mar 2, 2026 15:5741,722377,331,461345,289,0001,000,0002,371,584
5Mar 2, 2026 15:5741,753376,373,644342,560,0003,994,0002,359,296
6Mar 2, 2026 15:5741,775375,650,187344,731,0001,998,0002,539,520
7Mar 2, 2026 15:5741,784375,025,491345,805,000999,0002,543,616
8Mar 2, 2026 15:5741,821377,788,156344,117,0003,001,0002,375,680
9Mar 2, 2026 15:5741,838375,346,788346,253,0001,000,0002,355,200