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 listNov 14, 2024 22:03Ilango RajagopalIlango RajagopalScore: 110,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 22:07110,263943,830,440737,345,000177,842,0002,322,432
2Nov 14, 2024 22:07110,434939,974,465737,680,000178,922,0002,428,928
3Nov 14, 2024 22:07110,868948,644,088743,360,000176,847,0002,465,792
4Nov 14, 2024 22:03110,884947,403,558741,464,000178,870,0002,281,472
5Nov 14, 2024 22:03111,019950,772,408741,564,000179,894,0002,322,432
6Nov 14, 2024 22:03111,023947,056,065742,590,000178,901,0002,424,832