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 9, 2025 07:11Chaitanya GargChaitanya GargScore: 68,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 07:1267,744585,764,462508,251,00054,026,0002,273,280
2Dec 9, 2025 07:1267,919585,178,563500,758,00062,969,0002,383,872
3Dec 9, 2025 07:1267,999589,130,513509,357,00055,038,0002,383,872
4Dec 9, 2025 07:1168,042589,663,557504,773,00059,973,0002,379,776
5Dec 9, 2025 07:1168,044593,295,705503,788,00060,974,0002,273,280
6Dec 9, 2025 07:1168,145591,908,754504,646,00060,957,0002,392,064