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 6, 2025 10:06E SequeiraE SequeiraScore: 110,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 10:06110,392946,047,696855,301,00060,950,0002,330,624
2Feb 6, 2025 10:06110,444945,144,833856,578,00060,110,0002,330,624
3Feb 6, 2025 10:06111,335949,838,468863,143,00060,939,0002,330,624