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 listApr 27, 2026 10:00wnwnScore: 3,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:013,42644,096,17027,424,0001,015,0002,478,080
2Apr 27, 2026 10:013,44047,039,92327,533,0001,019,0002,486,272
3Apr 27, 2026 10:013,45644,901,40927,668,0001,024,0002,490,368
4Apr 27, 2026 10:013,47545,701,78726,860,0001,989,0002,478,080
5Apr 27, 2026 10:013,48344,722,49726,916,0001,993,0002,482,176
6Apr 27, 2026 10:013,49244,616,10826,991,0001,999,0002,494,464
7Apr 27, 2026 10:013,49642,619,15727,018,0002,001,0002,486,272
8Apr 27, 2026 10:013,57641,423,46528,661,0001,023,0002,551,808
9Apr 27, 2026 10:013,62348,804,44328,073,0002,005,0002,486,272