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 29, 2025 20:28syncnamesyncnameScore: 171,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 20:28171,1631,445,947,6141,329,676,00090,977,0002,326,528
2Oct 29, 2025 20:28171,1931,451,054,8631,322,981,00097,924,0002,437,120
3Oct 29, 2025 20:28171,2351,446,650,3041,316,306,000104,944,0002,326,528
4Oct 29, 2025 20:28171,2501,453,680,1351,318,417,000102,954,0002,326,528
5Oct 29, 2025 20:28171,3111,450,727,4021,327,893,00093,992,0002,326,528
6Oct 29, 2025 20:28171,4031,453,786,5831,318,674,000103,974,0002,326,528
7Oct 29, 2025 20:28171,9141,452,961,0411,353,942,00072,943,0002,326,528
8Oct 29, 2025 20:28172,1131,460,328,0371,345,563,00082,973,0002,326,528
9Oct 29, 2025 20:28172,3261,453,780,1641,321,362,000108,947,0002,326,528