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 2, 2024 17:13Bubble BoiBubble BoiScore: 66,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2024 17:1366,346621,688,036550,668,55502,248,704
2Feb 2, 2024 17:1366,378620,990,320550,939,27702,244,608
3Feb 2, 2024 17:1366,442606,115,196551,464,63502,240,512