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 9, 2024 15:19virusegvirusegScore: 99,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 15:1999,721856,562,375767,706,00059,977,0002,310,144
2Dec 9, 2024 15:1999,730861,726,658773,776,00053,984,0002,322,432
3Dec 9, 2024 15:1999,762852,195,884771,023,00057,001,0002,531,328
4Dec 9, 2024 15:1999,795852,479,467769,351,00058,950,0002,289,664
5Dec 9, 2024 15:1999,834855,929,440768,652,00059,972,0002,408,448
6Dec 9, 2024 15:1999,880854,767,591768,001,00061,000,0002,535,424
7Dec 9, 2024 15:1999,905857,511,291770,267,00058,943,0002,310,144
8Dec 9, 2024 15:19100,053857,000,045767,482,00062,957,0002,289,664
9Dec 9, 2024 15:19100,101855,880,865774,849,00055,989,0002,289,664