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 14, 2025 14:42ttmxttmxScore: 1,826,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 14, 2025 14:421,825,28315,180,280,14015,098,877,00050,975,0002,289,664
2Jan 14, 2025 14:421,825,79515,184,957,95915,093,125,00060,976,0002,289,664
3Jan 14, 2025 14:421,825,91915,193,700,23715,072,168,00082,962,0002,289,664
4Jan 14, 2025 14:421,826,04715,188,302,09015,103,217,00052,976,0002,289,664
5Jan 14, 2025 14:421,826,79215,192,570,66615,093,408,00068,969,0002,277,376
6Jan 14, 2025 14:421,827,05815,198,989,10415,099,613,00064,968,0002,277,376
7Jan 14, 2025 14:421,829,32715,220,693,66815,121,441,00061,973,0002,277,376
8Jan 14, 2025 14:421,829,82315,219,457,38515,101,564,00085,963,0002,375,680
9Jan 14, 2025 14:421,830,75015,235,923,36315,137,249,00057,977,0002,289,664