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 listNov 5, 2025 02:18Tejas G.Tejas G.Score: 7,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 02:187,10281,717,42756,952,0001,998,0002,289,664
2Nov 5, 2025 02:187,10680,801,27156,980,0001,999,0002,273,280
3Nov 5, 2025 02:187,10987,567,52357,003,0002,000,0002,289,664
4Nov 5, 2025 02:187,12084,017,84157,095,0002,003,0002,285,568
5Nov 5, 2025 02:187,12392,178,35658,118,0001,002,0002,289,664
6Nov 5, 2025 02:187,12581,730,89157,133,0002,004,0002,289,664
7Nov 5, 2025 02:187,12685,774,41958,144,0001,002,0002,289,664
8Nov 5, 2025 02:187,14482,404,02057,288,0002,010,0002,289,664
9Nov 5, 2025 02:187,17483,000,41758,538,0001,009,0002,269,184
10Nov 5, 2025 02:187,26285,151,78459,267,0001,004,0002,289,664
11Nov 5, 2025 02:187,33284,675,36958,862,0001,995,0002,519,040
12Nov 5, 2025 02:187,33584,478,41258,882,0001,996,0002,269,184