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 12:23Rajarshi BasuRajarshi BasuScore: 16,155Success
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 12:2316,144160,057,276131,993,0001,999,0002,289,664
2Nov 30, 2025 12:2316,155156,890,329132,086,0002,001,0002,363,392
3Nov 30, 2025 12:2316,157160,358,149132,103,0002,001,0002,523,136