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 listDec 9, 2025 10:55Gunsoo KimGunsoo KimScore: 59,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 10:5559,241516,708,578489,704,0001,998,0002,277,376
2Dec 9, 2025 10:5559,251518,720,112487,788,0003,998,0002,269,184
3Dec 9, 2025 10:5559,253522,019,037490,802,000999,0002,273,280
4Dec 9, 2025 10:5559,261519,597,188489,867,0001,999,0002,273,280
5Dec 9, 2025 10:5559,264515,441,644488,895,0002,999,0002,277,376
6Dec 9, 2025 10:5559,273513,808,717486,965,0004,999,0002,277,376
7Dec 9, 2025 10:5559,275518,014,226489,985,0001,999,0002,260,992
8Dec 9, 2025 10:5559,290520,375,556490,111,0002,000,0002,285,568
9Dec 9, 2025 10:5559,303514,056,574492,219,00002,277,376