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 listJul 3, 2021 18:50Sergey SamokhvalovSergey SamokhvalovScore: 27,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2021 18:5027,145251,505,680166,227,00059,080,0002,392,064
2Jul 3, 2021 18:5027,154285,688,262225,375,55002,244,608
3Jul 3, 2021 18:5027,200250,952,048165,826,00059,937,0002,400,256
4Jul 3, 2021 18:5027,265250,472,897167,221,00059,078,0002,392,064
5Jul 3, 2021 18:5027,266262,512,590226,306,06902,248,704
6Jul 3, 2021 18:5027,290257,190,064173,391,00053,119,0002,392,064
7Jul 3, 2021 18:5027,406270,922,915227,467,23802,256,896
8Jul 3, 2021 18:5027,442253,437,435168,831,00058,941,0002,523,136
9Jul 3, 2021 18:5027,491257,545,712171,130,00057,043,0002,523,136
10Jul 3, 2021 18:5027,507248,871,694178,242,00050,068,0002,392,064
11Jul 3, 2021 18:5027,539255,158,682164,414,00064,161,0002,523,136
12Jul 3, 2021 18:5027,564256,203,833168,837,00059,942,0002,523,136