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 8, 2024 15:51Bubble BoiBubble BoiScore: 56,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2024 15:5156,170534,806,064466,208,93802,248,704
2Feb 8, 2024 15:5156,215530,570,582466,588,07602,232,320
3Feb 8, 2024 15:5156,329530,421,262467,529,77402,236,416