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 29, 2025 09:01Aman | अमनAman | अमनScore: 518,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 09:01517,8704,321,940,1294,216,357,00081,968,0002,506,752
2Dec 29, 2025 09:01517,9754,331,002,8474,238,215,00060,974,0002,502,656
3Dec 29, 2025 09:01518,1244,327,256,2034,246,453,00053,980,0002,281,472
4Dec 29, 2025 09:01518,2264,328,497,3644,230,301,00070,971,0002,281,472
5Dec 29, 2025 09:01518,4534,331,296,3724,218,199,00084,963,0002,281,472
6Dec 29, 2025 09:01518,5274,334,044,8664,219,818,00083,956,0002,293,760
7Dec 29, 2025 09:01518,5774,333,615,1824,221,243,00082,945,0002,289,664
8Dec 29, 2025 09:01519,0594,340,131,5444,227,223,00080,965,0002,281,472
9Dec 29, 2025 09:01519,0884,342,724,9164,241,474,00066,960,0002,289,664