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 listDec 5, 2025 20:56Rajarshi BasuRajarshi BasuScore: 19,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 20:5619,690192,058,941152,401,00011,029,0002,445,312
2Dec 5, 2025 20:5619,767187,436,038147,056,00017,006,0002,359,296
3Dec 5, 2025 20:5620,012193,198,298151,089,00015,008,0002,449,408