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 1, 2025 21:18E SequeiraE SequeiraScore: 85,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 21:1885,548738,310,121656,042,00054,003,0002,486,272
2Feb 1, 2025 21:1885,612740,664,223660,608,00049,970,0002,322,432
3Feb 1, 2025 21:1885,704735,409,676654,315,00057,027,0002,318,336