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 listApr 23, 2025 21:09Alona MalohAlona MalohScore: 70,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 21:0970,077604,454,757519,674,00061,961,0002,277,376
2Apr 23, 2025 21:0970,274608,219,504503,240,00080,038,0002,285,568
3Apr 23, 2025 21:0970,309611,527,655499,626,00083,937,0002,277,376
4Apr 23, 2025 21:0970,323611,907,070498,729,00084,953,0002,379,776
5Apr 23, 2025 21:0970,382609,087,128489,143,00095,027,0002,273,280
6Apr 23, 2025 21:0970,400616,719,343507,282,00077,042,0002,277,376
7Apr 23, 2025 21:0970,495608,606,923506,097,00079,015,0002,277,376
8Apr 23, 2025 21:0970,585611,556,250505,876,00079,980,0002,285,568
9Apr 23, 2025 21:0970,617609,696,095504,105,00082,017,0002,273,280