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 06:45Chaitanya GargChaitanya GargScore: 395,162Success
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 06:45394,6173,299,829,0723,198,364,00076,960,0002,289,664
2Dec 9, 2025 06:45394,6643,300,012,6623,191,745,00083,966,0002,289,664
3Dec 9, 2025 06:45394,9693,307,208,7643,223,270,00054,970,0002,289,664
4Dec 9, 2025 06:45394,9793,301,778,5683,191,374,00086,955,0002,281,472
5Dec 9, 2025 06:45395,1623,306,936,2773,221,864,00057,979,0002,281,472
6Dec 9, 2025 06:45395,2233,304,114,9243,205,389,00074,962,0002,281,472
7Dec 9, 2025 06:45395,3143,308,988,2613,204,154,00076,955,0002,289,664
8Dec 9, 2025 06:45395,3343,310,203,9333,202,317,00078,958,0002,285,568
9Dec 9, 2025 06:45399,5263,340,657,6253,250,104,00065,961,0002,289,664