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 listAug 1, 2026 11:22George SeabridgeGeorge SeabridgeScore: 7,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 11:226,70165,623,42954,538,0001,088,0002,113,536
2Aug 1, 2026 11:226,70565,607,20754,582,0001,074,0002,113,536
3Aug 1, 2026 11:226,71366,444,28654,639,0001,079,0002,113,536
4Aug 1, 2026 11:226,73066,668,24554,787,0001,076,0002,113,536
5Aug 1, 2026 11:227,95676,031,39464,938,0001,097,0002,113,536
6Aug 1, 2026 11:227,96476,267,42864,995,0001,112,0002,113,536
7Aug 1, 2026 11:227,97676,186,32565,115,0001,089,0002,113,536
8Aug 1, 2026 11:227,98876,270,79365,217,0001,089,0002,113,536
9Aug 1, 2026 11:228,01776,519,03365,453,0001,096,0002,113,536