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:20Sergey SamokhvalovSergey SamokhvalovScore: 27,231Success
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:2027,118272,720,607225,082,28102,224,128
2Jul 3, 2021 18:2027,144253,696,269170,226,00055,073,0002,387,968
3Jul 3, 2021 18:2027,160262,595,517225,425,22502,228,224
4Jul 3, 2021 18:2027,175260,046,117165,407,00060,148,0002,281,472
5Jul 3, 2021 18:2027,191279,337,659225,683,74702,228,224
6Jul 3, 2021 18:2027,201257,333,361158,840,00066,932,0002,273,280
7Jul 3, 2021 18:2027,231251,773,932165,014,00061,005,0002,273,280
8Jul 3, 2021 18:2027,276252,964,824171,297,00055,095,0002,281,472
9Jul 3, 2021 18:2027,338260,976,845165,934,00060,975,0002,383,872
10Jul 3, 2021 18:2027,386248,808,813164,218,00063,083,0002,392,064
11Jul 3, 2021 18:2027,390250,169,256159,234,00068,100,0002,281,472
12Jul 3, 2021 18:2027,526253,429,766168,346,00060,123,0002,387,968