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 26, 2025 18:37hunaphuhunaphuScore: 58,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 18:3757,844505,856,823423,095,00057,012,0002,260,992
2Dec 26, 2025 18:3757,859500,959,034423,200,00057,026,0002,404,352
3Dec 26, 2025 18:3757,911502,735,754417,709,00062,956,0002,273,280
4Dec 26, 2025 18:3757,917504,739,058417,747,00062,961,0002,273,280
5Dec 26, 2025 18:3758,004510,988,459420,377,00061,054,0002,273,280
6Dec 26, 2025 18:3758,075505,378,796424,022,00058,003,0002,400,256
7Dec 26, 2025 18:3758,088509,746,559424,118,00058,016,0002,273,280
8Dec 26, 2025 18:3758,096508,771,880422,170,00060,024,0002,404,352
9Dec 26, 2025 18:3758,118507,650,614421,329,00061,047,0002,400,256