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 21, 2025 01:28Gerard SmitGerard SmitScore: 259,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 01:28254,0612,139,969,2741,394,147,000714,563,0002,314,240
2Jan 21, 2025 01:28254,9022,146,364,8851,444,102,000671,582,0002,387,968
3Jan 21, 2025 01:28256,3572,153,167,6211,420,173,000707,588,0002,314,240
4Jan 21, 2025 01:28259,7522,185,261,6001,412,304,000743,634,0002,314,240
5Jan 21, 2025 01:28259,7572,182,344,8641,375,351,000780,631,0002,310,144
6Jan 21, 2025 01:28260,7482,195,972,8121,409,832,000754,375,0002,293,760
7Jan 21, 2025 01:28262,2712,203,382,6461,362,280,000814,570,0002,310,144
8Jan 21, 2025 01:28262,2852,203,218,2781,447,311,000729,653,0002,383,872
9Jan 21, 2025 01:28263,1272,208,619,2021,466,299,000717,657,0002,502,656