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 23, 2025 20:48Cameron AavikCameron AavikScore: 21,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 20:4821,759208,887,525128,427,00052,173,0002,453,504
2Jan 23, 2025 20:4821,792206,528,224122,914,00057,959,0002,387,968
3Jan 23, 2025 20:4821,793210,651,620125,918,00054,964,0002,383,872
4Jan 23, 2025 20:4821,815206,552,125124,047,00057,021,0002,441,216
5Jan 23, 2025 20:4821,825207,076,549127,105,00054,044,0002,375,680
6Jan 23, 2025 20:4821,859207,215,599121,285,00060,141,0002,383,872
7Jan 23, 2025 20:4821,879210,169,388122,403,00059,195,0002,392,064
8Jan 23, 2025 20:4822,141219,505,396127,839,00055,929,0002,441,216
9Jan 23, 2025 20:4822,146210,026,364120,878,00062,936,0002,392,064