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 17:02GraceGraceScore: 74,727Success
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 17:0273,413670,280,708609,324,01202,281,472
2Jun 7, 2024 17:0273,492674,067,427609,985,12102,281,472
3Jun 7, 2024 17:0273,827671,664,343612,762,55802,277,376
4Jun 7, 2024 17:0274,340671,642,780617,022,56802,281,472
5Jun 7, 2024 17:0274,568691,657,259618,918,09602,269,184
6Jun 7, 2024 17:0274,682690,730,207619,860,16402,269,184
7Jun 7, 2024 17:0274,727684,438,496620,236,68502,277,376
8Jun 7, 2024 17:0275,005683,418,480622,538,56202,273,280
9Jun 7, 2024 17:0275,017685,787,251622,639,96302,285,568
10Jun 7, 2024 17:0275,137687,265,200623,633,14702,273,280
11Jun 7, 2024 17:0276,590710,798,909635,694,52202,277,376
12Jun 7, 2024 17:0276,740698,847,276636,941,88202,281,472