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 listApr 26, 2025 03:23nnScore: 372,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2025 03:23371,0793,109,469,2703,008,977,00070,975,0002,281,472
2Apr 26, 2025 03:23372,2323,114,955,2633,040,549,00048,976,0002,359,296
3Apr 26, 2025 03:23384,6063,216,947,9993,125,267,00066,962,0002,281,472