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 15:55Rajarshi BasuRajarshi BasuScore: 13,848Success
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 15:5513,844142,442,314113,910,000999,0002,289,664
2Nov 30, 2025 15:5713,845148,405,100112,918,0001,998,0002,277,376
3Nov 30, 2025 15:5713,847149,324,960113,931,000999,0002,289,664
4Nov 30, 2025 15:5513,848140,264,043113,939,000999,0002,367,488
5Nov 30, 2025 15:5713,858140,537,539113,021,0002,000,0002,510,848
6Nov 30, 2025 15:5513,876144,626,816113,166,0002,002,0002,277,376