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:02Chaitanya GargChaitanya GargScore: 67,915Success
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:0267,733586,842,495507,170,00055,018,0002,285,568
2Dec 9, 2025 07:0267,863585,168,399504,237,00059,027,0002,375,680
3Dec 9, 2025 07:0267,875597,322,935507,326,00056,036,0002,269,184
4Dec 9, 2025 07:0267,905585,866,463503,548,00060,065,0002,383,872
5Dec 9, 2025 07:0267,915590,602,926508,728,00054,970,0002,269,184
6Dec 9, 2025 07:0267,922588,882,147502,782,00060,973,0002,383,872
7Dec 9, 2025 07:0268,022591,615,951506,626,00057,957,0002,273,280
8Dec 9, 2025 07:0268,262589,840,098504,619,00061,953,0002,273,280
9Dec 9, 2025 07:0268,369593,832,360506,518,00060,942,0002,273,280