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 16, 2025 03:05Ahmed MhedhbiAhmed MhedhbiScore: 52,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2025 03:0552,078452,619,035431,250,0001,000,0002,273,280
2Dec 16, 2025 03:0552,079463,821,099431,254,0001,000,0002,273,280
3Dec 16, 2025 03:0552,092455,326,271432,361,00002,273,280
4Dec 16, 2025 03:0552,094461,712,559431,377,0001,000,0002,273,280
5Dec 16, 2025 03:0552,101463,159,435431,440,0001,001,0002,273,280
6Dec 16, 2025 03:0552,105456,097,252432,471,00002,273,280
7Dec 16, 2025 03:0552,117463,686,579432,571,00002,273,280
8Dec 16, 2025 03:0552,122460,455,562432,612,00002,273,280
9Dec 16, 2025 03:0552,126461,992,623430,650,0001,998,0002,273,280