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 listNov 30, 2025 19:02Rajarshi BasuRajarshi BasuScore: 14,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 19:0214,039147,162,484115,521,0001,004,0002,527,232
2Nov 30, 2025 19:0214,064143,203,700114,738,0001,995,0002,260,992
3Nov 30, 2025 19:0214,069141,301,131115,773,000998,0002,363,392