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 listSep 30, 2025 01:35CheranMahalingamCheranMahalingamScore: 395,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2025 01:35394,4683,301,937,1303,189,133,00084,950,0002,510,848
2Sep 30, 2025 01:35394,9753,306,112,9933,218,326,00059,968,0002,289,664
3Sep 30, 2025 01:35395,1243,315,124,4523,206,583,00072,945,0002,289,664
4Sep 30, 2025 01:35395,3473,308,243,7763,204,420,00076,962,0002,281,472
5Sep 30, 2025 01:35395,3733,306,387,3583,229,620,00051,977,0002,281,472
6Sep 30, 2025 01:35395,3953,312,632,6713,217,799,00063,976,0002,281,472
7Sep 30, 2025 01:35395,5653,308,361,8393,203,236,00079,955,0002,506,752
8Sep 30, 2025 01:35395,7693,322,697,4003,218,928,00065,957,0002,281,472
9Sep 30, 2025 01:35400,1423,346,118,6303,254,213,00066,963,0002,502,656