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 4, 2024 02:00Bubble BoiBubble BoiScore: 56,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2024 02:0056,365534,350,528467,832,33602,232,320
2Feb 4, 2024 02:0056,381528,846,269467,961,79302,240,512
3Feb 4, 2024 02:0056,551526,328,404469,371,68902,236,416