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 29, 2025 14:31Aman | अमनAman | अमनScore: 52,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 14:3152,652465,926,602435,015,0002,000,0002,519,040
2Dec 29, 2025 14:3152,653464,091,802436,017,0001,000,0002,523,136
3Dec 29, 2025 14:3152,664458,260,214435,114,0002,000,0002,383,872
4Dec 29, 2025 14:3152,665458,534,139436,121,0001,000,0002,523,136
5Dec 29, 2025 14:3152,666460,361,731436,127,0001,000,0002,519,040
6Dec 29, 2025 14:3152,669463,076,006436,153,0001,000,0002,396,160
7Dec 29, 2025 14:3152,670461,388,732436,157,0001,000,0002,387,968
8Dec 29, 2025 14:3152,671458,350,983436,170,0001,000,0002,379,776
9Dec 29, 2025 14:3152,672458,163,725436,176,0001,000,0002,506,752