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 listApr 26, 2024 23:18Joad NacerJoad NacerScore: 15,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2024 23:1815,115194,333,865125,458,49202,273,280
2Apr 26, 2024 23:1815,158190,848,155125,814,97902,256,896
3Apr 26, 2024 23:1815,196151,655,872124,122,0002,001,0002,506,752
4Apr 26, 2024 23:1815,199149,531,053124,151,0002,002,0002,285,568
5Apr 26, 2024 23:1815,199149,044,924124,150,0002,002,0002,277,376
6Apr 26, 2024 23:1815,211149,151,830125,253,0001,002,0002,510,848
7Apr 26, 2024 23:1815,214149,442,337125,271,0001,002,0002,285,568
8Apr 26, 2024 23:1815,217154,501,384124,300,0002,004,0002,510,848
9Apr 26, 2024 23:1815,226150,719,498124,371,0002,005,0002,519,040
10Apr 26, 2024 23:1815,306149,164,316125,038,0002,000,0002,277,376
11Apr 26, 2024 23:1815,376153,938,698127,619,00002,285,568
12Apr 26, 2024 23:1815,553184,048,811129,093,41402,281,472