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 11, 2025 21:07NeoNeoScore: 33,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2025 21:0733,345306,506,070275,763,000999,0002,269,184
2Feb 11, 2025 21:0733,372302,884,597274,986,0001,999,0002,531,328
3Feb 11, 2025 21:0734,796310,544,568286,805,0001,998,0002,437,120