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 listFeb 16, 2026 21:32wnwnScore: 8,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 21:338,20292,222,13566,077,0002,002,0002,400,256
2Feb 16, 2026 21:338,22488,807,88666,251,0002,007,0002,416,640
3Feb 16, 2026 21:338,24790,860,52865,430,0003,019,0002,379,776
4Feb 16, 2026 21:338,40294,588,12066,750,0002,988,0002,387,968
5Feb 16, 2026 21:338,406100,319,08365,783,0003,986,0002,396,160
6Feb 16, 2026 21:338,408100,979,48666,797,0002,990,0002,437,120
7Feb 16, 2026 21:338,42592,003,94266,931,0002,996,0002,387,968
8Feb 16, 2026 21:338,49297,409,68067,462,0003,020,0002,273,280
9Feb 16, 2026 21:338,66697,274,56068,933,0002,997,0002,416,640