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 8, 2025 11:36Jatin GargJatin GargScore: 395,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:36394,5013,303,131,7623,200,394,00073,962,0002,281,472
2Dec 8, 2025 11:36394,7653,302,844,0043,187,588,00088,960,0002,289,664
3Dec 8, 2025 11:36394,8103,301,471,6743,203,950,00072,976,0002,285,568
4Dec 8, 2025 11:36395,1643,303,784,8213,188,893,00090,968,0002,289,664
5Dec 8, 2025 11:36395,2113,305,815,6633,200,292,00079,957,0002,281,472
6Dec 8, 2025 11:36396,1353,310,438,0223,218,962,00068,956,0002,330,624
7Dec 8, 2025 11:36396,4513,320,191,4953,223,570,00066,970,0002,289,664
8Dec 8, 2025 11:36396,4603,314,596,3833,223,651,00066,971,0002,281,472
9Dec 8, 2025 11:36396,5203,316,664,2103,211,166,00079,954,0002,289,664