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 12, 2025 12:38AdityaAdityaScore: 493,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2025 12:38492,0444,106,583,6714,020,001,00063,968,0002,273,280
2Jan 12, 2025 12:38492,2374,115,733,1754,029,605,00055,966,0002,273,280
3Jan 12, 2025 12:38492,6514,114,122,3004,022,038,00066,967,0002,392,064
4Jan 12, 2025 12:38492,6834,116,703,7484,018,321,00070,952,0002,273,280
5Jan 12, 2025 12:38493,4864,119,801,7154,032,963,00062,968,0002,273,280
6Jan 12, 2025 12:38493,5194,125,223,9924,024,239,00071,968,0002,273,280
7Jan 12, 2025 12:38493,6374,121,400,9274,037,214,00059,973,0002,273,280
8Jan 12, 2025 12:38493,9344,128,344,5174,040,685,00058,966,0002,273,280
9Jan 12, 2025 12:38494,1544,128,198,0514,041,518,00059,963,0002,383,872