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 4, 2026 09:16Teow Hua JunTeow Hua JunScore: 6,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 09:176,27562,134,52750,985,0001,099,0002,113,536
2Aug 4, 2026 09:176,29162,240,92251,102,0001,115,0002,113,536
3Aug 4, 2026 09:176,36662,861,11051,746,0001,093,0002,113,536
4Aug 4, 2026 09:176,36962,869,07551,794,0001,075,0002,113,536
5Aug 4, 2026 09:176,37062,898,97851,738,0001,134,0002,113,536
6Aug 4, 2026 09:176,37162,880,64151,775,0001,109,0002,113,536
7Aug 4, 2026 09:176,37262,804,99151,772,0001,123,0002,113,536
8Aug 4, 2026 09:176,38263,708,32251,835,0001,136,0002,113,536
9Aug 4, 2026 09:176,39663,063,75052,001,0001,088,0002,113,536