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 listOct 22, 2025 14:42TakopiTakopiScore: 395,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 14:42394,4353,303,366,3123,202,834,00070,974,0002,289,664
2Oct 22, 2025 14:42394,6553,310,620,7493,198,671,00076,968,0002,285,568
3Oct 22, 2025 14:42394,9393,298,803,1803,220,027,00057,964,0002,285,568
4Oct 22, 2025 14:42394,9493,307,364,0693,207,115,00070,958,0002,285,568
5Oct 22, 2025 14:42395,6213,308,672,4863,212,704,00070,949,0002,281,472
6Oct 22, 2025 14:42396,1303,314,832,9243,211,925,00075,950,0002,285,568
7Oct 22, 2025 14:42396,2093,313,986,6873,216,567,00071,967,0002,281,472
8Oct 22, 2025 14:42405,3113,389,454,2253,287,124,00076,956,0002,260,992
9Oct 22, 2025 14:42410,1073,435,687,3153,329,931,00073,954,0002,281,472