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 listJan 7, 2026 12:16Shubham Kr. VermaShubham Kr. VermaScore: 73,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 12:1673,545636,800,182549,381,00061,042,0002,277,376
2Jan 7, 2026 12:1673,559641,338,129550,586,00059,955,0002,383,872
3Jan 7, 2026 12:1673,581634,176,638553,748,00056,974,0002,277,376
4Jan 7, 2026 12:1673,591636,231,339552,823,00057,981,0002,273,280
5Jan 7, 2026 12:1673,605635,245,998547,928,00062,991,0002,498,560
6Jan 7, 2026 12:1673,655637,845,120549,301,00062,034,0002,277,376
7Jan 7, 2026 12:1673,748636,043,174553,099,00059,010,0002,277,376
8Jan 7, 2026 12:1673,765637,919,173552,226,00060,024,0002,273,280
9Jan 7, 2026 12:1673,872637,427,019554,122,00059,013,0002,273,280