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 listOct 28, 2024 18:36ndrenndrenScore: 133,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2024 18:36133,9091,138,786,0691,035,485,00075,962,0002,379,776
2Oct 28, 2024 18:36133,9341,139,152,0761,038,679,00072,977,0002,383,872
3Oct 28, 2024 18:36133,9481,138,231,0261,037,787,00073,984,0002,273,280
4Oct 28, 2024 18:36133,9541,132,956,9251,036,832,00074,987,0002,387,968
5Oct 28, 2024 18:36133,9661,137,256,6161,038,925,00072,994,0002,387,968
6Oct 28, 2024 18:36133,9681,138,256,8461,038,938,00072,995,0002,273,280
7Oct 28, 2024 18:36133,9911,136,719,4971,035,120,00077,008,0002,387,968
8Oct 28, 2024 18:36134,0931,138,219,4521,060,972,00051,998,0002,273,280
9Oct 28, 2024 18:36136,2271,156,047,8701,059,706,00070,980,0002,273,280