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 listAug 30, 2025 21:35Adam FolwarcznyAdam FolwarcznyScore: 10,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 21:3410,052109,694,09746,682,00036,749,0002,293,760
2Aug 30, 2025 21:3410,107108,298,69843,426,00040,465,0002,334,720
3Aug 30, 2025 21:3410,228111,570,51547,384,00037,512,0002,506,752
4Aug 30, 2025 21:3410,263118,195,81148,536,00036,649,0002,330,624
5Aug 30, 2025 21:3510,264113,812,02752,501,00032,689,0002,318,336
6Aug 30, 2025 21:3510,265111,740,00146,561,00038,636,0002,482,176
7Aug 30, 2025 21:3510,291107,131,03446,680,00038,734,0002,506,752
8Aug 30, 2025 21:3510,303114,062,42545,743,00039,776,0002,502,656
9Aug 30, 2025 21:3410,304111,191,57549,722,00035,800,0002,310,144
10Aug 30, 2025 21:3410,349119,049,67949,368,00036,532,0002,465,792
11Aug 30, 2025 21:3510,351122,259,79348,952,00036,964,0002,506,752
12Aug 30, 2025 21:3510,446115,977,31048,833,00037,870,0002,502,656