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 listMar 3, 2026 07:36Priyansh RathiPriyansh RathiScore: 40,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 07:3640,561361,135,632334,658,0001,997,0002,547,712
2Mar 3, 2026 07:3640,597362,435,869334,953,0001,999,0002,539,520
3Mar 3, 2026 07:3640,614365,614,258335,095,0002,000,0002,375,680