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 21:03Rajarshi BasuRajarshi BasuScore: 15,773Success
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 21:0315,129156,453,429112,510,00013,059,0002,502,656
2Dec 5, 2025 21:0315,773157,565,335115,924,00014,990,0002,375,680
3Dec 5, 2025 21:0316,205165,305,518121,453,00013,048,0002,502,656