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 listJun 7, 2024 11:11GraceGraceScore: 80,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 11:1180,286722,049,340666,370,43002,240,512
2Jun 7, 2024 11:1180,372733,807,868667,085,84002,244,608
3Jun 7, 2024 11:1180,407737,588,753667,376,95602,232,320
4Jun 7, 2024 11:1180,487728,983,755668,045,27202,244,608
5Jun 7, 2024 11:1180,553721,068,525668,589,54702,236,416
6Jun 7, 2024 11:1180,636728,803,630669,276,90102,240,512
7Jun 7, 2024 11:1180,679729,511,740669,636,31702,240,512
8Jun 7, 2024 11:1180,809746,901,387670,714,07602,244,608
9Jun 7, 2024 11:1180,833747,230,307670,914,85102,240,512
10Jun 7, 2024 11:1180,965742,890,260672,009,71502,232,320
11Jun 7, 2024 11:1180,966736,810,220672,014,34802,228,224
12Jun 7, 2024 11:1181,727738,131,561678,331,61602,236,416