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 22, 2025 03:30Josu San MartinJosu San MartinScore: 74,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 03:3074,530639,835,779560,633,00057,962,0002,506,752
2Dec 22, 2025 03:3074,538639,564,708554,697,00063,965,0002,269,184
3Dec 22, 2025 03:3074,810642,498,966536,930,00083,989,0002,387,968