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 1, 2025 20:57E SequeiraE SequeiraScore: 74,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 20:5774,957648,469,570565,129,00057,013,0002,326,528
2Feb 1, 2025 20:5774,959650,043,803561,143,00061,015,0002,326,528
3Feb 1, 2025 20:5775,238656,714,702565,529,00058,950,0002,326,528